A note on non-\(\mathbb{R}\)-cospectral graphs

zbMath1358.05175MaRDI QIDQ521370

Fenjin Liu, Wei Wang

Publication date: 10 April 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i1p48

zbMATH Keywords

\(\mathbb{R}\)-cospectral graphsirrational orthogonal matrixwalk generating function

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

Descriptive complexity of graph spectra ⋮ Generalized spectral characterizations of almost controllable graphs ⋮ The smallest pair of cospectral cubic graphs with different chromatic indexes

Cites Work

• Unnamed Item
• On the spectral characterization of pineapple graphs
• A simple arithmetic criterion for graphs being determined by their generalized spectra
• Generalized spectral characterization of graphs revisited
• Spectral characterizations of almost complete graphs
• Cospectral graphs and regular orthogonal matrices of level 2
• Constructing cospectral graphs
• Spectral determination of graphs whose components are paths and cycles
• Cospectral graphs and the generalized adjacency matrix
• Developments on spectral characterizations of graphs
• A note on cospectral graphs
• Which graphs are determined by their spectrum?
• Enumeration of cospectral graphs.
• A new method for constructing graphs determined by their generalized spectrum
• A sufficient condition for a family of graphs being determined by their generalized spectra
• On a Conjecture of Godsil Concerning Controllable Random Graphs