๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A note on the kth eigenvalue of trees

โœ Scribed by Ji-Ming Guo


Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
103 KB
Volume
413
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


The kth Laplacian eigenvalue of a tree
โœ Ji-Ming Guo ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 102 KB

## Abstract Let ฮป~__k__~(__G__) be the __k__th Laplacian eigenvalue of a graph __G__. It is shown that a tree __T__ with __n__ vertices has $\lambda\_{k}(T)\le \lceil { {n}\over{k}}\rceil$ and that equality holds if and only if __k__ < __n__, __k__|__n__ and __T__ is spanned by __k__ vertex disjoin

Sharp bound of the kth eigenvalue of tre
โœ Jiansheng Chen ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 585 KB

The sharp lower bound of the kth largest positive eigenvalue of a tree T with n vertices, and the sharp lower bound of the positive eigenvalues of such a tree Tare worked out in this study. A conjecture on the sharp bound of the kth eigenvalue of such a T is proved.

On multiple eigenvalues of trees
โœ P. Rowlinson ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 115 KB