On the asymptotic behavior of graphs determined by their generalized spectra

DOI10.1016/j.disc.2009.07.028zbMath1216.05080OpenAlexW2104120185MaRDI QIDQ1045144

Wei Wang, Cheng-Xian Xu

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.07.028

zbMATH Keywords

cospectral graphsdetermined by spectrumspectra of graphs

Mathematics Subject Classification ID

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

Related Items (2)

Generalized spectral characterization of graphs revisited ⋮ Spectral classes of regular, random, and empirical graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An excluding algorithm for testing whether a family of graphs are determined by their generalized spectra
• Spectral characterization of graphs with index at most \(\sqrt {2+\sqrt {5}}\)
• Starlike trees are determined by their Laplacian spectrum
• Spectral characterizations of lollipop graphs
• The multi-fan graphs are determined by their Laplacian spectra
• Developments on spectral characterizations of graphs
• Which graphs are determined by their spectrum?
• Enumeration of cospectral graphs.
• On the spectral characterization of T-shape trees
• Graph \(Z_{n}\) and some graphs related to \(Z_{n}\) are determined by their spectrum
• A sufficient condition for a family of graphs being determined by their generalized spectra
• Asymptotic enumeration of Latin rectangles

This page was built for publication: On the asymptotic behavior of graphs determined by their generalized spectra