✦ LIBER ✦

Sharp upper bounds on the second largest eigenvalues of connected graphs

✍ Scribed by Mingqing Zhai; Huiqiu Lin; Bing Wang

Book ID: 113772274
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 280 KB
Volume: 437
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2012.02.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Several sharp upper bounds for the large

Several sharp upper bounds for the largest laplacian eigenvalue of a graph

✍ Tian-fei Wang 📂 Article 📅 2007 🏛 SP Science China Press 🌐 English ⚖ 226 KB

Some bounds on the largest eigenvalues o

Some bounds on the largest eigenvalues of graphs

✍ Shuchao Li; Yi Tian 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 255 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

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

On the second largest eigenvalue of line

On the second largest eigenvalue of line graphs

✍ Petrovi?, Miroslav; Mileki?, Bojana 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 169 KB 👁 2 views

In this paper all connected line graphs whose second largest eigenvalue does not exceed 1 are characterized. Besides, all minimal line graphs with second largest eigenvalue greater than 1 are determined.