1. University of Kragujevac Digital Archive
  2. University of Kragujevac
  3. Faculty of Science, Kragujevac
Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/10007
Full metadata record
DC FieldValueLanguage
dc.rights.licenserestrictedAccess-
dc.contributor.authorPetrović, Miroslav-
dc.contributor.authorAleksić, Tatjana-
dc.contributor.authorSimic, Zoran-
dc.date.accessioned2021-04-20T14:38:00Z-
dc.date.available2021-04-20T14:38:00Z-
dc.date.issued2011-
dc.identifier.issn0024-3795-
dc.identifier.urihttps://scidar.kg.ac.rs/handle/123456789/10007-
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. © 2011 Elsevier Inc. All rights reserved.-
dc.rightsinfo:eu-repo/semantics/restrictedAccess-
dc.sourceLinear Algebra and Its Applications-
dc.titleFurther results on the least eigenvalue of connected graphs-
dc.typearticle-
dc.identifier.doi10.1016/j.laa.2011.04.030-
dc.identifier.scopus2-s2.0-79958782229-
Appears in Collections:Faculty of Science, Kragujevac

Page views(s)

733

Downloads(s)

12

Files in This Item:
File Description SizeFormat 
PaperMissing.pdf
  Restricted Access		29.86 kBAdobe PDFThumbnail
View/Open
Show simple item record


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