Spectral characterization of graphs whose second largest eigenvalue is less than 1

DOI10.1016/j.laa.2010.06.011zbMath1225.05171OpenAlexW2020517152MaRDI QIDQ616272

Fenjin Liu, Jianfeng Wang, Qiong Xiang Huang

Publication date: 7 January 2011

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2010.06.011

zbMATH Keywords

spectrumcospectral graphssecond largest eigenvaluespectral characterization

Mathematics Subject Classification ID

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

Related Items (1)

Spectral characterization of unicyclic graphs whose second largest eigenvalue does not exceed 1

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Starlike trees are determined by their Laplacian spectrum
• Spectral characterizations of lollipop graphs
• The multi-fan graphs are determined by their Laplacian spectra
• On generalized \(\theta \)-graphs whose second largest eigenvalue does not exceed 1
• On graphs with exactly one eigenvalue less than -1
• Sharp lower bounds on the eigenvalues of trees
• Which graphs are determined by their spectrum?
• On unicyclic graphs whose second largest eigenvalue does not exceed 1
• The complement of the path is determined by its spectrum
• On the spectral characterization of T-shape trees
• The spectral characterization of graphs of index less than 2 with no path as a component

This page was built for publication: Spectral characterization of graphs whose second largest eigenvalue is less than 1