Sharp upper bounds on the second largest eigenvalues of connected graphs

DOI10.1016/J.LAA.2012.02.004MaRDI QIDQ417583zbMATH OpenOpenAlexFDO

Authors Huiqiu Lin, Bing Wang, Mingqing Zhai

Publication date 14 May 2012

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

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

zbMATH Keywords

bipartite graphthe second largest eigenvalue

Mathematics Subject Classification ID

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

Recommendations

• Upper bound for the Laplacian graph eigenvalues
• scientific article; zbMATH DE number 5003617
• On graphs with second largest eigenvalue less than 1
• Bounds of eigenvalues of a nontrivial bipartite graph.
• Some graphs whose second largest eigenvalue does not exceed \(\sqrt 2\)

Cites work

• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• scientific article; zbMATH DE number 3783047 (Why is no real title available?)
• Bounds of eigenvalues of a graph
• Graph partitioning by eigenvectors
• On the largest \(k\)th eigenvalues of trees
• The second largest eigenvalue of a tree

Cited in

(8)

• scientific article; zbMATH DE number 810358 (Why is no real title available?)
• On the eigenvalues of firefly graphs
• The second largest eigenvalue and vertex-connectivity of regular multigraphs
• Positive semidefiniteness of \(A_\alpha (G)\) on some families of graphs
• Sharp bounds for the second-order general connectivity index of hexagonal chains
• A note on \(\lambda_2\) and \(\lambda_n\) of a graph
• Bounds of eigenvalues of a nontrivial bipartite graph.
• On the two largest distance eigenvalues of graph powers

This page was built for publication: Sharp upper bounds on the second largest eigenvalues of connected graphs

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