On the k th Eigenvalues of Trees with Perfect Matchings
Let Τ + 2p be the set of all trees on 2p (p≥ 1) vertices with perfect matchings. In this paper, we prove that for any tree T in Τ + 2p, its k-th largest eigenvalue λ k (T) satisfies λ k (T)≤ 1 / 2 (√{⌈p / k⌉-1}+ √{⌈p / k⌉+3}) (k=1,2,..,p) and show that this upper bound is the best po...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2007-01-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Online Access: | http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/484 |