𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The least eigenvalue of the complements of trees

✍ Scribed by Yi-Zheng Fan; Fei-Fei Zhang; Yi Wang

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
200 KB
Volume
435
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

✦ Synopsis

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 .

πŸ“œ SIMILAR VOLUMES

On the least eigenvalue of cacti
On the least eigenvalue of cacti
✍ Miroslav PetroviΔ‡; Tatjana AleksiΔ‡; ViΕ‘nja SimiΔ‡ πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 274 KB

Among the cacti with n vertices and k cycles we determine a unique cactus whose least eigenvalue is minimal. We also explore cacti with n vertices and among them, we find a unique cactus whose least eigenvalue is minimal.

Locating the Eigenvalues of Trees
Locating the Eigenvalues of Trees
✍ David P. Jacobs; Vilmar Trevisan πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 497 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.