The proof on the conjecture of extremal graphs for the \(k\)th eigenvalues of trees

DOI10.1016/J.LAA.2007.02.031zbMath1124.05059OpenAlexW2071718880WikidataQ123206850 ScholiaQ123206850MaRDI QIDQ996214

Jiansheng Chen

Publication date: 13 September 2007

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2007.02.031

zbMATH Keywords

treeeigenvaluecharacteristic polynomialsubtree

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Unnamed Item
• Spektren endlicher Grafen
• A note on the \(k\)th eigenvalue of trees
• Bounds on the \(k\)th eigenvalues of trees and forests
• Sharp bound of the \(k\)th eigenvalue of trees
• On the largest \(k\)th eigenvalues of trees with \(n\equiv 0 \pmod k\)
• On the largest \(k\)th eigenvalues of trees

This page was built for publication: The proof on the conjecture of extremal graphs for the \(k\)th eigenvalues of trees