Cospectral Graphs and Digraphs

DOI10.1112/blms/3.3.321zbMath0224.05125OpenAlexW2090206300MaRDI QIDQ5629664

Abbe Mowshowitz, Ronald C. Read, Clarence C. King, Frank Harary

Publication date: 1971

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2027.42/135469

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)

Related Items (35)

Spectral characterization of multicone graphs ⋮ On some counting polynomials in chemistry ⋮ A survey of the theory of hypercube graphs ⋮ On irreducible endospectral graphs ⋮ On the characteristic polynomial of homeomorphic images of a graph ⋮ Per-spectral characterizations of some edge-deleted subgraphs of a complete graph ⋮ Per-spectral characterizations of some bipartite graphs ⋮ On the Characteristic Equations of the Characteristic Polynomial ⋮ On the characterizing properties of the permanental polynomials of graphs ⋮ A note on cospectral graphs ⋮ Digraphs with real and Gaussian spectra ⋮ Spectral radii of friendship graphs and their connected induced subgraphs ⋮ Construction of cospectral graphs ⋮ On the spectrum of a complete multipartite graph ⋮ Permanental polynomials of graphs ⋮ A reduction formula for the characteristic polynomial of hypergraph with pendant edges ⋮ Per-spectral characterizations of graphs with extremal per-nullity ⋮ Per-spectral characterizations of bicyclic networks ⋮ On the spectral determinations of the connected multicone graphs ⋮ Spectra of digraphs ⋮ Spectra of coronae ⋮ A new algorithm for digraph isomorphism ⋮ An introduction to matching polynomials ⋮ Complementarity spectrum of digraphs ⋮ On a class of polynomials obtained from the circuits in a graph and its application to characteristic polynomials of graphs ⋮ Extremal problems involving the two largest complementarity eigenvalues of a graph ⋮ The characteristic polynomial of a graph ⋮ Characterizing properties of permanental polynomials of lollipop graphs ⋮ The spectra of digraphs with Morita equivalent \(C^\ast\)-algebras ⋮ Cospectral graphs and digraphs with given automorphism group ⋮ Some further development on the eigensystem approach for graph isomorphism detection ⋮ Computing the characteristic polynomial of a tree ⋮ On the power of a perturbation for testing non-isomorphism of graphs ⋮ Evaluation of the characteristic polynomial of a graph ⋮ Factoring distance matrix polynomials

This page was built for publication: Cospectral Graphs and Digraphs