Constructing cospectral graphs via regular rational orthogonal matrices with level two
From MaRDI portal
Publication:2092382
DOI10.1016/j.disc.2022.113156zbMath1502.05140OpenAlexW4294042898WikidataQ114190448 ScholiaQ114190448MaRDI QIDQ2092382
Wei Wang, Lihong Qiu, Lihuan Mao, Fenjin Liu
Publication date: 2 November 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2022.113156
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized spectral characterization of graphs revisited
- Cospectral graphs and regular orthogonal matrices of level 2
- Constructing cospectral graphs
- On the generalized spectral characterizations of Eulerian graphs
- An excluding algorithm for testing whether a family of graphs are determined by their generalized spectra
- Cospectral graphs and the generalized adjacency matrix
- Riemannian coverings and isospectral manifolds
- Enumeration of cospectral graphs.
- Cospectral graphs, GM-switching and regular rational orthogonal matrices of level \(p\)
- The characteristic polynomial of a graph
- On the Polynomial of a Graph