DSpace
 
  Repositório Institucional da Universidade de Aveiro > Departamento de Matemática > MAT - Artigos >
 A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
Please use this identifier to cite or link to this item http://hdl.handle.net/10773/4256

title: A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
authors: 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.
URI: http://hdl.handle.net/10773/4256
ISSN: 0024-3795
publisher version/DOI: http://www.sciencedirect.com/science/article/pii/S0024379508002528
source: Linear Algebra and Its Applications
appears in collectionsMAT - Artigos

files in this item

file description sizeformat
CardosoCvetkovicRowlinsonSimic.pdfElectronic Version149.21 kBAdobe PDFview/open
Restrict Access. You can Request a copy!
statistics

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

 

Valid XHTML 1.0! RCAAP OpenAIRE DeGóis
ria-repositorio@ua.pt - Copyright ©   Universidade de Aveiro - RIA Statistics - Powered by MIT's DSpace software, Version 1.6.2