𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs

✍ Scribed by V. Brankov; P. Hansen; D. Stevanović


Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
191 KB
Volume
414
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


A sharp upper bound on the largest Lapla
✍ Kinkar Ch. Das; R.B. Bapat 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 217 KB

We consider weighted graphs, where the edge weights are positive definite matrices. The Laplacian of the graph is defined in the usual way. We obtain an upper bound on the largest eigenvalue of the Laplacian and characterize graphs for which the bound is attained. The classical bound of Anderson and