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

DOI10.1016/j.laa.2018.10.027zbMath1405.05108OpenAlexW2899277329MaRDI 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 graphsgraph spectraGM-switchingrational orthogonal matrix

Mathematics Subject Classification ID

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

Related Items (16)

Unlocking the walk matrix of a graph ⋮ 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 with at most one generalized cospectral mate ⋮ Godsil-McKay switching for mixed and gain graphs over the circle group ⋮ Cospectral constructions for several graph matrices using cousin vertices ⋮ Graphs cospectral with \(\operatorname{NU}(n + 1,q^2)\), \(n \neq 3\) ⋮ New strongly regular graphs from finite geometries via switching ⋮ An arithmetic criterion for graphs being determined by their generalized \(A_\alpha \)-spectra ⋮ Constructing cospectral signed graphs ⋮ The smallest pair of cospectral cubic graphs with different chromatic indexes ⋮ Constructing cospectral graphs via regular rational orthogonal matrices with level two ⋮ The connectivity and the spectral radius of commuting graphs on certain finite groups

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

This page was built for publication: Cospectral graphs, GM-switching and regular rational orthogonal matrices of level \(p\)