DC FieldValueLanguage
dc.contributor.authorPetrović, Miroslaven
dc.contributor.authorAleksić, Tatjanaen
dc.contributor.authorSimić, Slobodanen
dc.date.accessioned2020-05-01T20:12:48Z-
dc.date.available2020-05-01T20:12:48Z-
dc.date.issued2011-11-01en
dc.identifier.issn0024-3795en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1138-
dc.description.abstractIn this paper, we identify within connected graphs of order n and size n+k (with 0≤k≤4 and n≥k+5) the graphs whose least eigenvalue is minimal. It is also observed that the same graphs have the largest spectral spread if n is large enough.en
dc.publisherElsevier-
dc.relationGraph theory and mathematical programming with applications in chemistry and computer science-
dc.relation.ispartofLinear Algebra and Its Applicationsen
dc.subjectSpectral spread | The largest eigenvalue | The least eigenvalueen
dc.titleFurther results on the least eigenvalue of connected graphsen
dc.typeArticleen
dc.identifier.doi10.1016/j.laa.2011.04.030en
dc.identifier.scopus2-s2.0-79958782229en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage2303en
dc.relation.lastpage2313en
dc.relation.issue9en
dc.relation.volume435en
dc.description.rankM22-
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.grantfulltextnone-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/novi_sajt/research/projects/174033e.php-
crisitem.project.fundingProgramDirectorate for Computer & Information Science & Engineering-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NSF/Directorate for Computer & Information Science & Engineering/1740333-
Show simple item record

SCOPUSTM   
Citations

15
checked on Apr 3, 2025

Page view(s)

25
checked on Jan 31, 2025

Google ScholarTM

Check

Altmetric

Altmetric


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