The proof on the conjecture of extremal graphs for the kth eigenvalues of trees

DOI10.1016/J.LAA.2007.02.031MaRDI QIDQ996214zbMATH OpenOpenAlexWikidataFDO

Authors 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

characteristic polynomialeigenvaluesubtreetree

Mathematics Subject Classification ID

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

Recommendations

• On the largest \(k\)th eigenvalues of trees with \(n\equiv 0 \pmod k\)
• Bounds on the \(k\)th eigenvalues of trees and forests
• On the largest \(k\)th eigenvalues of trees
• On the kth eigenvalues of trees and perfect matchings
• The kth largest eigenvalue of a tree

Cites work

• A note on the \(k\)th eigenvalue of trees
• Bounds on the \(k\)th eigenvalues of trees and forests
• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• On the largest \(k\)th eigenvalues of trees
• On the largest \(k\)th eigenvalues of trees with \(n\equiv 0 \pmod k\)
• Sharp bound of the kth eigenvalue of trees
• Spektren endlicher Grafen

Cited in

(4)

• The kth largest eigenvalue of a tree
• On the largest \(k\)th eigenvalues of trees with \(n\equiv 0 \pmod k\)
• On the maximum second eigenvalue of outerplanar graphs
• A note on the \(k\)th eigenvalue of trees

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

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