On a theorem of Godsil and McKay concerning the construction of cospectral graphs
From MaRDI portal
Publication:2197138
DOI10.1016/j.laa.2020.05.025zbMath1446.05060MaRDI QIDQ2197138
Wei Wang, Lihong Qiu, Yizhe Ji
Publication date: 28 August 2020
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2020.05.025
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
Related Items
Cospectral mates for generalized Johnson and Grassmann graphs, Finding singularly cospectral graphs, Statistical Analysis of Random Objects Via Metric Measure Laplacians, A switching method for constructing cospectral gain graphs, The smallest pair of cospectral cubic graphs with different chromatic indexes
Cites Work
- Unnamed Item
- Unnamed Item
- Cospectral graphs and regular orthogonal matrices of level 2
- Constructing cospectral graphs
- Developments on spectral characterizations of graphs
- Riemannian coverings and isospectral manifolds
- Which graphs are determined by their spectrum?
- Controllable subsets in graphs
- A sufficient condition for a family of graphs being determined by their generalized spectra
- On a Conjecture of Godsil Concerning Controllable Random Graphs