Cospectral graphs, GM-switching and regular rational orthogonal matrices of level \(p\)

DOI10.1016/j.laa.2018.10.027zbMath1405.05108MaRDI QIDQ1713301

Wei Wang, Yulin Hu, Lihong Qiu

Publication date: 24 January 2019

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2018.10.027

zbMATH Keywords

cospectral graphs; graph spectra; GM-switching; rational orthogonal matrix

Mathematics Subject Classification ID

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

Related Items

Constructing cospectral signed graphs, The connectivity and the spectral radius of commuting graphs on certain finite groups, Switching for Small Strongly Regular Graphs, A general construction of strictly Neumaier graphs and a related switching, Cospectral mates for generalized Johnson and Grassmann graphs, Non-geometric cospectral mates of line graphs with a linear representation, A switching method for constructing cospectral gain graphs, Graphs cospectral with \(\operatorname{NU}(n + 1,q^2)\), \(n \neq 3\), An arithmetic criterion for graphs being determined by their generalized \(A_\alpha \)-spectra, The smallest pair of cospectral cubic graphs with different chromatic indexes, Constructing cospectral graphs via regular rational orthogonal matrices with level two, Unlocking the walk matrix of a graph, Godsil-McKay switching for mixed and gain graphs over the circle group, Cospectral constructions for several graph matrices using cousin vertices, New strongly regular graphs from finite geometries via switching, Graphs with at most one generalized cospectral mate

Cites Work

• Unnamed Item
• Unnamed Item
• A simple arithmetic criterion for graphs being determined by their generalized spectra
• Generalized spectral characterization of graphs revisited
• Cospectral graphs and regular orthogonal matrices of level 2
• Constructing cospectral graphs
• Spektren endlicher Grafen
• An excluding algorithm for testing whether a family of graphs are determined by their generalized spectra
• Riemannian coverings and isospectral manifolds
• Controllable subsets in graphs
• A sufficient condition for a family of graphs being determined by their generalized spectra
• The characteristic polynomial of a graph
• On a Conjecture of Godsil Concerning Controllable Random Graphs
• On the Polynomial of a Graph
• Can One Hear the Shape of a Drum?
• On hearing the shape of a drum