✦ LIBER ✦

A lower bound for the Laplacian eigenvalues of a graph—Proof of a conjecture by Guo

✍ Scribed by Andries E. Brouwer; Willem H. Haemers

Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 97 KB
Volume: 429
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2008.06.008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

A sharp lower bound for the least eigenv

A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph

✍ Domingos M. Cardoso; Dragoš Cvetković; Peter Rowlinson; Slobodan K. Simić 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 149 KB

We prove that the minimum value of the least eigenvalue of the signless Laplacian of a connected nonbipartite graph with a prescribed number of vertices is attained solely in the unicyclic graph obtained from a triangle by attaching a path at one of its endvertices.

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 Laplacian eigenvalues of a graph

✍ Jiong-Sheng Li; Xiao-Dong Zhang 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 148 KB

In the note, we present an upper bound for the spectral radius of Laplacian matrix of a graph in terms of a "2-degree" of a vertex.

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 lower bound for the circumference of a

A lower bound for the circumference of a graph

✍ Nathan Linial 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 423 KB

Lrzt G = (V, 0 be a ttlock :.>f order n, different from Kn. Let ~FI = min {d(x) + d(y): n then G contains a cycle of length at least m. 1. Introductlion and notatio e discuss only finite undirected graphs withsLc loops and multiple edges. We p:rosye the main theorem d show how Qre's th -orem [ 3.1 o