Graphs with at most one generalized cospectral mate
From MaRDI portal
Publication:2692177
DOI10.37236/10826OpenAlexW4323670402MaRDI QIDQ2692177
Publication date: 21 March 2023
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.01888
Related Items (6)
A new criterion for almost controllable graphs being determined by their generalized spectra ⋮ Generalized spectral characterization of rooted product graphs ⋮ Generalized spectral characterizations of a new family of noncontrollable graphs ⋮ A structure theorem for the restricted sum of four squares ⋮ The Smith normal form of the walk matrix of the Dynkin graph \(D_n\) for \(n \equiv 0 \pmod{4}\) ⋮ Smith normal form and the generalized spectral characterization of graphs
Cites Work
- A simple arithmetic criterion for graphs being determined by their generalized spectra
- Generalized spectral characterization of graphs revisited
- Constructing cospectral graphs
- Developments on spectral characterizations of graphs
- A note on cospectral graphs
- Which graphs are determined by their spectrum?
- Cospectral graphs, GM-switching and regular rational orthogonal matrices of level \(p\)
- Graphs cospectral with \(\operatorname{NU}(n + 1,q^2)\), \(n \neq 3\)
- Smith normal form and the generalized spectral characterization of graphs
- New strongly regular graphs from finite geometries via switching
- A sufficient condition for a family of graphs being determined by their generalized spectra
This page was built for publication: Graphs with at most one generalized cospectral mate
