✦ LIBER ✦

Sharp lower bounds on the Laplacian eigenvalues of trees

✍ Scribed by Kinkar Ch. Das

Book ID: 108198693
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 262 KB
Volume: 384
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2004.01.012

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sharp lower bounds on the eigenvalues of

Sharp lower bounds on the eigenvalues of trees

✍ Hong Yuan 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 295 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

Two sharp upper bounds for the Laplacian

Two sharp upper bounds for the Laplacian eigenvalues

✍ Xiao-Dong Zhang 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 168 KB

In this paper, we first obtain a sharp upper bound for the eigenvalues of the adjacency matrix of the line graph of a graph. Then this result is used to present a sharp upper bound for the Laplacian eigenvalues. Another sharp upper bound is presented also. Moreover, we determine all extreme graphs w

Lower bounds for the eigenvalues of Lapl

Lower bounds for the eigenvalues of Laplacian matrices

✍ Abraham Berman; Xiao-Dong Zhang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 70 KB

We give a lower bound for the second smallest eigenvalue of Laplacian matrices in terms of the isoperimetric number of weighted graphs. This is used to obtain an upper bound for the real parts of the nonmaximal eigenvalues of irreducible nonnegative matrices.

Bounds on eigenvalues of Dirichlet Lapla

Bounds on eigenvalues of Dirichlet Laplacian

✍ Qing-Ming Cheng; Hongcang Yang 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 207 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.