Sharp lower bounds on the eigenvalues of trees
From MaRDI portal
Publication:1123213
DOI10.1016/0024-3795(89)90288-7zbMath0677.05058OpenAlexW2013867978MaRDI QIDQ1123213
Publication date: 1989
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(89)90288-7
Trees (05C05) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (18)
On the largest \(k\)th eigenvalues of trees ⋮ Bounds on the second largest eigenvalue of a tree with perfect matchings ⋮ Spectral characterization of graphs whose second largest eigenvalue is less than 1 ⋮ Extremal problems for the eccentricity matrices of complements of trees ⋮ On the smallest positive eigenvalue of bipartite graphs with a unique perfect matching ⋮ Group inverses of weighted trees ⋮ On tricyclic graphs whose second largest eigenvalue does not exceed 1 ⋮ Graphs with second largest eigenvalue less than 1/2 ⋮ Upper bounds on the smallest positive eigenvalue of trees ⋮ On unicyclic graphs whose second largest eigenvalue does not exceed 1 ⋮ Spectral characterization of unicyclic graphs whose second largest eigenvalue does not exceed 1 ⋮ On alternating paths and the smallest positive eigenvalue of trees ⋮ Some results on the Laplacian eigenvalues of unicyclic graphs ⋮ On bicyclic graphs whose second largest eigenvalue does not exceed 1 ⋮ On the third largest eigenvalue of a graph ⋮ On the smallest positive eigenvalue of bipartite unicyclic graphs with a unique perfect matching ⋮ Bounds of eigenvalues of graphs ⋮ Sharp bound of the \(k\)th eigenvalue of trees
Cites Work
This page was built for publication: Sharp lower bounds on the eigenvalues of trees
