On the third largest eigenvalue of a graph

DOI10.1016/S0024-3795(00)00159-2zbMath0961.05048WikidataQ127526472 ScholiaQ127526472MaRDI QIDQ1587896

Bo Zhou, Bo Lian Liu

Publication date: 21 May 2001

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

zbMATH Keywords

grapheigenvalueincidence matrixbound

Mathematics Subject Classification ID

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

Related Items (3)

On the third largest eigenvalue of graphs ⋮ Spectral conditions for edge connectivity and spanning tree packing number in (multi-)graphs ⋮ Edge connectivity, packing spanning trees, and eigenvalues of graphs

Cites Work

• Unnamed Item
• Sharp lower bounds on the eigenvalues of trees
• Bounds on the \(k\)th eigenvalues of trees and forests
• Recent results in the theory of graph spectra
• The distribution of eigenvalues of graphs

This page was built for publication: On the third largest eigenvalue of a graph