𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An always nontrivial upper bound for Laplacian graph eigenvalues

✍ Scribed by Oscar Rojo; Ricardo Soto; Héctor Rojo


Book ID
108360530
Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
54 KB
Volume
312
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


A new upper bound for eigenvalues of the
✍ Li Jiong-Sheng; Zhang Xiao-Dong 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 270 KB

We first give a result on eigenvalues of the line graph of a graph. We then use the result to present a new upper bound for eigenvalues of the Laplacian matrix of a graph. Moreover we determine all graphs the largest eigenvalue of whose Laplacian matrix reaches the upper bound.