A note on the kth eigenvalue of trees
In [Linear Algebra Appl. 149, 19--34 (1991; Zbl 0764.05066)], \textit{J.-Y. Shao} proved that, for a tree \(T\) on \(n\) vertices, the \(k\)th eigenvalue \(\lambda_k(T)\) satisfies \( \lambda_k(T)\leq \sqrt{\frac{n}{k} - 1}\) \((1\leq k \leq \frac{n}{k}) \) and that this bound is best possible for all \(n \not\equiv 0\pmod k\) and for \(k=1\). Here it is proved that this bound is attained if and only if there exists a vertex \(v\) of \(T\) such that \(T-v = K_{1,\frac{n}{k} - 1} \cup F\), where \(F\) is a forest and \(\lambda_{k-1}(F) = \sqrt{\frac{n}{k} - 1}\).
- The kth largest eigenvalue of a tree
- Bounds on the \(k\)th eigenvalues of trees and forests
- Sharp bound of the kth eigenvalue of trees
- On the largest \(k\)th eigenvalues of trees with \(n\equiv 0 \pmod k\)
- A note on the integer eigenvalues of the Laplacian matrix of a balanced binary tree
- A note on the multiplicities of the eigenvalues of a tree
- On the minimum number of distinct eigenvalues in the problem for a tree formed by Stieltjes strings
- Thekth Laplacian eigenvalue of a tree
- scientific article; zbMATH DE number 5123568 (Why is no real title available?)
- On the multiple eigenvalue of Randić matrix of trees
- The proof on the conjecture of extremal graphs for the \(k\)th eigenvalues of trees
This page was built for publication: A note on the \(k\)th eigenvalue of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817643)