An improved condition for a family of trees being determined by their generalized spectrum

DOI10.1016/J.DISC.2024.113956MaRDI QIDQ6494935

Jie Yang, Wei Wang

Publication date: 30 April 2024

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

zbMATH Keywords

treecospectral graphsgraph spectradetermined by spectrumrational orthogonal matrix

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)

Cites Work

• Unnamed Item
• Unnamed Item
• A simple arithmetic criterion for graphs being determined by their generalized spectra
• Generalized spectral characterization of graphs revisited
• Constructing cospectral graphs
• Spectra of graphs
• On the generalized spectral characterizations of Eulerian graphs
• Developments on spectral characterizations of graphs
• Riemannian coverings and isospectral manifolds
• A note on cospectral graphs
• Which graphs are determined by their spectrum?
• Controllable subsets in graphs
• Smith normal form and the generalized spectral characterization of graphs
• An improved condition for a graph to be determined by its generalized spectrum
• A sufficient condition for a family of graphs being determined by their generalized spectra

This page was built for publication: An improved condition for a family of trees being determined by their generalized spectrum