Sharp lower bounds on the eigenvalues of trees

DOI10.1016/0024-3795(89)90288-7MaRDI QIDQ1123213zbMATH OpenOpenAlexFDO

Authors Hong Yuan

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

zbMATH Keywords

eigenvalueforest

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Review text

It is proved that the smallest positive eigenvalue in a forest with n vertices is bounded from below by the same eigenvalue in a path with \(2\lfloor n/2\rfloor\) vertices. With some exceptions (which are described), the second largest eigenvalue of a tree is not smaller than 1.

Recommendations

• scientific article; zbMATH DE number 4210169
• Sharp bound of the kth eigenvalue of trees
• Sharp bounds on the eigenvalues of trees
• Sharp lower bounds on the Laplacian eigenvalues of trees
• Bounds on the \(k\)th eigenvalues of trees and forests

Cites work

• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• Inverses of trees

Cited in

(28)

• Sharp bounds on the 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
• Sharp bound of the kth eigenvalue of trees
• On unicyclic graphs whose second largest eigenvalue does not exceed 1
• On the third largest eigenvalue of a graph
• Sharp lower bounds on the Laplacian eigenvalues of trees
• On the largest \(k\)th eigenvalues of trees
• On the smallest positive eigenvalue of bipartite unicyclic graphs with a unique perfect matching
• Upper bounds on the smallest positive eigenvalue of trees with at most one zero eigenvalue
• Spectral characterization of unicyclic graphs whose second largest eigenvalue does not exceed 1
• On alternating paths and the smallest positive eigenvalue of trees
• On bicyclic 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
• scientific article; zbMATH DE number 3891410 (Why is no real title available?)
• scientific article; zbMATH DE number 1135741 (Why is no real title available?)
• The Path Resistance Method for Bounding the Smallest Nontrivial Eigenvalue of a Laplacian
• 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
• Spectral characterization of graphs whose second largest eigenvalue is less than 1
• On tricyclic graphs whose second largest eigenvalue does not exceed 1
• On the smallest positive eigenvalue of bipartite unicyclic graphs with a unique perfect matching II
• An upper bound for the height of a tree with a given eigenvalue
• Bounds for the smallest positive eigenvalue of unicyclic graphs with diameter at most 4
• On the smallest positive eigenvalue of caterpillar unicyclic graphs

This page was built for publication: Sharp lower bounds on the eigenvalues of trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1123213)