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

DOI10.1016/J.LAA.2010.06.011zbMATH Open1225.05171OpenAlexW2020517152MaRDI QIDQ616272FDOQ616272

Authors: Fenjin Liu, Jianfeng Wang, Qiongxiang 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

Recommendations

• On graphs whose second largest eigenvalue is less than 1
• On graphs with second largest eigenvalue less than 1
• Some notes on graphs whose second largest eigenvalue is less than (√5−1)/2
• On the second largest distance eigenvalue of a graph
• Some graphs whose second largest eigenvalue does not exceed \(\sqrt 2\)

zbMATH Keywords

cospectral graphssecond largest eigenvaluespectrumspectral characterization

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (8)

• Some graph mappings that preserve the sign of \(\lambda_2 - r\)
• Title not available (Why is that?)
• Spectral characterizations of graphs with small second largest Laplacian eigenvalue
• Spectral characterization of unicyclic graphs whose second largest eigenvalue does not exceed 1
• On graphs whose second largest eigenvalue is less than 1
• On graphs with second largest eigenvalue less than 1
• On graphs with exactly one eigenvalue less than -1
• Characterization of outerplanar graphs whose second largest eigenvalue is at most 1

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q616272)