Title of article
A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph Original Research Article
Author/Authors
Domingos M. Cardoso، نويسنده , , Drago? Cvetkovi?، نويسنده , , Peter Rowlinson، نويسنده , , Slobodan K. Simi?، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
11
From page
2770
To page
2780
Abstract
We prove that the minimum value of the least eigenvalue of the signless Laplacian of a connected non-bipartite 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.
Keywords
graph theory , Line graph , Signless Laplacian , Least eigenvalue , Graph spectra
Journal title
Linear Algebra and its Applications
Serial Year
2008
Journal title
Linear Algebra and its Applications
Record number
826184
Link To Document