✦ LIBER ✦

Locating the Eigenvalues of Trees

✍ Scribed by David P. Jacobs; Vilmar Trevisan

Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 497 KB
Volume: 434
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2010.08.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On multiple eigenvalues of trees

✍ P. Rowlinson 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 115 KB

Sharp bounds on the eigenvalues of trees

✍ Shengbiao Hu 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 289 KB

Let λ 1 (T ) and λ 2 (T ) be the largest and the second largest eigenvalues of a tree T , respectively. We obtain the following sharp lower bound for λ 1 (T ): where d i is the degree of the vertex v i and m i is the average degree of the adjacent vertices of v i . Equality holds if and only if T i

On the two largest eigenvalues of trees

✍ M. Hofmeister 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 650 KB

Very little is known about upper bounds for the largest eigenvalues of a tree that depend only on the vertex number. Starting from a classical upper bound for the largest eigenvalue, some refinements can be obtained by successively removing trees from consideration. The results can be used to charac

Sharp lower bounds on the eigenvalues of

Sharp lower bounds on the eigenvalues of trees

✍ Hong Yuan 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 295 KB

The least eigenvalue of the complements

The least eigenvalue of the complements of trees

✍ Yi-Zheng Fan; Fei-Fei Zhang; Yi Wang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 200 KB

Let T c n be the set of the complements of trees of order n. In this paper, we characterize the unique graph whose least eigenvalue attains the minimum among all graphs in T c n .

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