✦ LIBER ✦

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

✍ Scribed by Domingos M. Cardoso; Dragoš Cvetković; Peter Rowlinson; Slobodan K. Simić

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

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

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

Sharp lower bounds of the least eigenval

Sharp lower bounds of the least eigenvalue of planar graphs

✍ Yuan Hong; Jin-Long Shu 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 75 KB

Let G be a simple graph with n P 3 vertices and orientable genus g and non-orientable genus h. We de®ne the Euler characteristic vq of a graph G by vq maxf2 À 2gY 2 À hg. Let kq be the least eigenvalue of the adjacency matrix A of G. In this paper, we obtain the following lower bounds of kq kq P À 2

A note on the signless Laplacian eigenva

A note on the signless Laplacian eigenvalues of graphs

✍ Jianfeng Wang; Francesco Belardo 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 188 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

A lower bound for the Laplacian eigenval

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

✍ Andries E. Brouwer; Willem H. Haemers 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 97 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.