On the largest kth eigenvalues of trees with n 0 k

DOI10.1016/S0024-3795(00)00212-3MaRDI QIDQ1593667zbMATH OpenFDO

Authors Yong Zou, Zheng Wang, Xuerong Yong

Publication date 21 June 2001

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

Full work available at URL https://doi.org/10.1016/S0024-3795(00)00212-3

zbMATH Keywords

eigenvalues of a graphextremal treeinduced subgraph

Mathematics Subject Classification ID

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

Recommendations

• On the largest \(k\)th eigenvalues of trees
• The proof on the conjecture of extremal graphs for the \(k\)th eigenvalues of trees
• scientific article; zbMATH DE number 4210169
• A note on the \(k\)th eigenvalue of trees
• The kth largest eigenvalue of a tree

Cites work

• On the largest \(k\)th eigenvalues of trees

Cited in

(4)

• On the largest \(k\)th eigenvalues of trees
• On the minimum number of distinct eigenvalues in the problem for a tree formed by Stieltjes strings
• A note on the \(k\)th eigenvalue of trees
• The proof on the conjecture of extremal graphs for the \(k\)th eigenvalues of trees

This page was built for publication: On the largest \(k\)th eigenvalues of trees with \(n\equiv 0 \pmod k\)

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