𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Characterization on graphs which achieve a Das’ upper bound for Laplacian spectral radius

✍ Scribed by Aimei Yu; Mei Lu; Feng Tian

Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
198 KB
Volume
400
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Extremal graph characterization from the
Extremal graph characterization from the upper bound of the Laplacian spectral radius of weighted graphs
✍ Kinkar Ch. Das 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 214 KB

We consider weighted graphs, where the edge weights are positive definite matrices. In this paper, we obtain two upper bounds on the spectral radius of the Laplacian matrix of weighted graphs and characterize graphs for which the bounds are attained. Moreover, we show that some known upper bounds on

A sharp upper bound on the largest Lapla
A sharp upper bound on the largest Laplacian eigenvalue of weighted graphs
✍ 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