✦ LIBER ✦

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

✍ Scribed by Kinkar Ch. Das

Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 215 KB
Volume: 376
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2003.06.009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Characterization on graphs which achieve

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

✍ Aimei Yu; Mei Lu; Feng Tian 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 198 KB

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

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

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