✦ LIBER ✦

The Kth largest eigenvalue of a tree

✍ Scribed by Hong Yuan

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 214 KB
Volume: 73
Category: Article
ISSN: 0024-3795
DOI: 10.1016/0024-3795(86)90237-5

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

The second largest eigenvalue of a tree

✍ A. Neumaier 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 981 KB

Sharp bound of the kth eigenvalue of tre

Sharp bound of the kth eigenvalue of trees

✍ 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 the second largest eigenvalue of line

On the second largest eigenvalue of line graphs

✍ Petrovi?, Miroslav; Mileki?, Bojana 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 169 KB 👁 2 views

In this paper all connected line graphs whose second largest eigenvalue does not exceed 1 are characterized. Besides, all minimal line graphs with second largest eigenvalue greater than 1 are determined.

The largest induced tree in a sparse ran

The largest induced tree in a sparse random graph

✍ W. Fernandez de la Vega 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 192 KB 👁 2 views

The author proved that, for c > 1, the random graph G(n, p ) on n vertices with edge probability p = c / n contains almost always an induced tree on at least q n ( 1 -o( 1)) vertices, where L Y ~ is the positive root of the equation CLY = log( 1 + c'a). It is shown here that if c is sufficiently lar

The largest tree in certain models of ra

The largest tree in certain models of random forests

✍ Ljuben Mutafchiev 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 227 KB 👁 2 views

We consider four families of forests on n vertices: labeled and unlabeled forests containing rooted and unrooted trees, respectively. A forest is chosen uniformly from one of the given four families. The limiting distribution of the size of its largest tree is then studied as n ª ϱ. Convergences to