✦ LIBER ✦

Ordering trees by their largest eigenvalues

✍ Scribed by An Chang; Qiongxiang Huang

Book ID: 104155482
Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 174 KB
Volume: 370
Category: Article
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(03)00384-7

No coin nor oath required. For personal study only.

✦ Synopsis

The set of trees with n vertices is denoted by T n . Hofmeister has determined the first five values of the largest eigenvalue of trees in T n and the corresponding trees for these values [Linear Algebra Appl. 260 (1997) 43]. In other words, an order of the first five trees in T n by their largest eigenvalues has been given. Focus on the same purpose, we shall give a partition for trees in T n first in the this paper and then extend this order to the eighth tree.

📜 SIMILAR VOLUMES

Ordering trees by their largest eigenval

Ordering trees by their largest eigenvalues

✍ Wenshui Lin; Xiaofeng Guo 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 179 KB

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

The Kth largest eigenvalue of a tree

✍ Hong Yuan 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 214 KB

The second largest eigenvalue of a tree

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

On the largest eigenvalues of trees with

On the largest eigenvalues of trees with perfect matchings

✍ Wenshui Lin; Xiaofeng Guo 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 217 KB

Ordering trees by their Laplacian spectr

Ordering trees by their Laplacian spectral radii

✍ Aimei Yu; Mei Lu; Feng Tian 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 430 KB