𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A lower bound on the least signless Laplacian eigenvalue of a graph

✍ Scribed by Guo, Shu-Guang; Chen, Yong-Gao; Yu, Guanglong

Book ID
122294744
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
208 KB
Volume
448
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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.