Sharp upper bounds on the second largest eigenvalues of connected graphs

DOI10.1016/J.LAA.2012.02.004zbMATH Open1241.05089OpenAlexW2054679537MaRDI QIDQ417583FDOQ417583

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

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\)

zbMATH Keywords

bipartite graphthe second largest eigenvalue

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The second largest eigenvalue of a tree
• Graph partitioning by eigenvectors
• Bounds of eigenvalues of a graph
• On the largest \(k\)th eigenvalues of trees
• Title not available (Why is that?)

Cited In (8)

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

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)