In this note, we present some upper bounds for the \(k\)th largest eigenvalue of the adjacency matrix as well as the Laplacian matrix of graphs. Special attention is paid to the Laplacian matrix of trees.
Citation
Lihua Feng, Guihai Yu. A Note on the Eigenvalues of Graphs[J], Ars Combinatoria, Volume 094. 221-227. .