Please use this identifier to cite or link to this item:
Title: A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
Author: Cardoso, D.M.
Cvetković, D.
Rowlinson, P.
Simić, S.K.
Keywords: Graph spectra
Least eigenvalue
Control theory
Bipartite graphs
Line graph
Signless Laplacian
Unicyclic graphs
Graph theory
Issue Date: 2008
Publisher: Elsevier
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. © 2008 Elsevier Inc. All rights reserved.
Peer review: yes
ISSN: 0024-3795
Publisher Version:
Appears in Collections:MAT - Artigos

Files in This Item:
File Description SizeFormat 
CardosoCvetkovicRowlinsonSimic.pdfElectronic Version149.21 kBAdobe PDF    Request a copy

FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.