DC FieldValueLanguage
dc.contributor.authorCardoso, Domingosen
dc.contributor.authorCvetković, Dragošen
dc.contributor.authorRowlinson, Peteren
dc.contributor.authorSimić, Slobodanen
dc.date.accessioned2020-05-01T20:12:50Z-
dc.date.available2020-05-01T20:12:50Z-
dc.date.issued2008-12-01en
dc.identifier.issn0024-3795en
dc.description.abstractWe 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.en
dc.publisherElsevier-
dc.relationSerbian Ministry for Science, Grant 144015G-
dc.relation.ispartofLinear Algebra and Its Applicationsen
dc.subjectGraph spectra | Graph theory | Least eigenvalue | Line graph | Signless Laplacianen
dc.titleA sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graphen
dc.typeArticleen
dc.identifier.doi10.1016/j.laa.2008.05.017en
dc.identifier.scopus2-s2.0-52449128742en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage2770en
dc.relation.lastpage2780en
dc.relation.issue11-12en
dc.relation.volume429en
dc.description.rankM22-
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
item.grantfulltextnone-
Show simple item record

SCOPUSTM   
Citations

87
checked on Nov 28, 2022

Page view(s)

12
checked on Nov 28, 2022

Google ScholarTM

Check

Altmetric

Altmetric


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