✦ LIBER ✦

Bounds and conjectures for the signless Laplacian index of graphs

✍ Scribed by Pierre Hansen; Claire Lucas

Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 267 KB
Volume: 432
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2010.01.027

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Proof of conjecture involving the second

Proof of conjecture involving the second largest signless Laplacian eigenvalue and the index of graphs

✍ Kinkar Ch. Das 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 301 KB

Sharp bounds on the signless laplacian s

Sharp bounds on the signless laplacian spectral radii of graphs

✍ Guanglong Yu; Yarong Wu; Jinlong Shu 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 192 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

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 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.

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