DC FieldValueLanguage
dc.contributor.authorBell, Francisen
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-07-01en
dc.identifier.issn0024-3795en
dc.description.abstractLet G be a connected graph whose least eigenvalue λ(G) is minimal among the connected graphs of prescribed order and size. We show first that either G is complete or λ(G) is a simple eigenvalue. In the latter case, the sign pattern of a corresponding eigenvector determines a partition of the vertex set, and we study the structure of G in terms of this partition. We find that G is either bipartite or the join of two graphs of a simple form.en
dc.publisherElsevier-
dc.relationEPSRC, Grant EP/D010748/1-
dc.relationSerbian Ministry for Science, Grant 144015G-
dc.relation.ispartofLinear Algebra and Its Applicationsen
dc.subjectGraph spectrum | Largest eigenvalue | Least eigenvalue | Nested split graphen
dc.titleGraphs for which the least eigenvalue is minimal, Ien
dc.typeArticleen
dc.identifier.doi10.1016/j.laa.2008.02.032en
dc.identifier.scopus2-s2.0-43049137654en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage234en
dc.relation.lastpage241en
dc.relation.issue1en
dc.relation.volume429en
dc.description.rankM22-
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.grantfulltextnone-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
Show simple item record

SCOPUSTM   
Citations

64
checked on Apr 8, 2022

Page view(s)

11
checked on Apr 8, 2022

Google ScholarTM

Check

Altmetric

Altmetric


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