✦ LIBER ✦

A sharp upper bound on the largest Laplacian eigenvalue of weighted graphs

✍ Scribed by Kinkar Ch. Das; R.B. Bapat

Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 217 KB
Volume: 409
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2005.06.024

No coin nor oath required. For personal study only.

✦ Synopsis

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 Morley, for the largest eigenvalue of the Laplacian of an unweighted graph follows as a special case.

📜 SIMILAR VOLUMES

A nontrivial upper bound on the largest

A nontrivial upper bound on the largest Laplacian eigenvalue of weighted graphs

✍ Oscar Rojo 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 138 KB

Automated conjectures on upper bounds fo

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

✍ V. Brankov; P. Hansen; D. Stevanović 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 191 KB

A decreasing sequence of upper bounds on

A decreasing sequence of upper bounds on the largest Laplacian eigenvalue of a graph

✍ Oscar Rojo; Héctor Rojo 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 251 KB

Sharp bounds for the largest eigenvalue

Sharp bounds for the largest eigenvalue of the signless Laplacian of a graph

✍ Yanqing Chen; Ligong Wang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 194 KB

A characterization on graphs which achie

A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs

✍ Kinkar Ch. Das 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 215 KB

A new upper bound for eigenvalues of the

A new upper bound for eigenvalues of the laplacian matrix of a graph

✍ 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.