Sharp bound of the \(k\)th eigenvalue of trees

DOI10.1016/0012-365X(94)90104-XzbMath0796.05067OpenAlexW1976814715MaRDI QIDQ1322172

Jiansheng Chen

Publication date: 15 September 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(94)90104-x

zbMATH Keywords

treeeigenvaluessharp bound

Mathematics Subject Classification ID

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

Related Items (4)

Group inverses of weighted trees ⋮ Discrete convolution-rearrangement inequalities and the Faber-Krahn inequality on regular trees ⋮ The proof on the conjecture of extremal graphs for the \(k\)th eigenvalues of trees ⋮ Upper bounds on the smallest positive eigenvalue of trees with at most one zero eigenvalue

Cites Work

• Unnamed Item
• Unnamed Item
• The kth largest eigenvalue of a tree
• Inverses of trees
• Sharp lower bounds on the eigenvalues of trees

This page was built for publication: Sharp bound of the \(k\)th eigenvalue of trees