Bounds on the \(k\)th eigenvalues of trees and forests
From MaRDI portal
Publication:1173948
DOI10.1016/0024-3795(91)90322-NzbMath0764.05066MaRDI QIDQ1173948
Publication date: 25 June 1992
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Related Items
Ordering trees by their largest eigenvalues, Ordering trees by their largest eigenvalues, A note on the \(k\)th eigenvalue of trees, On the \(k\)th Laplacian eigenvalues of trees with perfect matchings, On the second Laplacian eigenvalues of trees of odd order, The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph, The proof on the conjecture of extremal graphs for the \(k\)th eigenvalues of trees, Some results on the Laplacian eigenvalues of unicyclic graphs, Bounds on the second largest eigenvalue of a tree with perfect matchings, Bounds of eigenvalues of graphs, A note on the second largest eigenvalue of a tree with perfect matchings., On the third largest eigenvalue of a graph, A conjecture on the second largest eigenvalue of a tree with perfect matchings, On the largest \(k\)th eigenvalues of trees, An interlacing technique for spectra of random walks and its application to finite percolation clusters, On the \(s\)th Laplacian eigenvalue of trees of order \(st+1\), On the second largest Laplacian eigenvalue of trees
Cites Work
