SCIDAR - A Digital Archive of the University of Kragujevac
A digital archive of the University of Kragujevac contains easily searchable and up-to-date research results.
Please use this identifier to cite or link to this item:
https://scidar.kg.ac.rs/handle/123456789/10007Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Petrović, Miroslav | - |
| dc.contributor.author | Aleksić, Tatjana | - |
| dc.contributor.author | Simic, Zoran | - |
| dc.date.accessioned | 2021-04-20T14:38:00Z | - |
| dc.date.available | 2021-04-20T14:38:00Z | - |
| dc.date.issued | 2011 | - |
| dc.identifier.issn | 0024-3795 | - |
| dc.identifier.uri | https://scidar.kg.ac.rs/handle/123456789/10007 | - |
| dc.description.abstract | In 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.rights | restrictedAccess | - |
| dc.source | Linear Algebra and Its Applications | - |
| dc.title | Further results on the least eigenvalue of connected graphs | - |
| dc.type | article | - |
| dc.identifier.doi | 10.1016/j.laa.2011.04.030 | - |
| dc.identifier.scopus | 2-s2.0-79958782229 | - |
| Appears in Collections: | Faculty of Science, Kragujevac | |
 | Page views(s)120 | Downloads(s)5 |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| PaperMissing.pdf Restricted Access | 29.86 kB | Adobe PDF |  View/Open |
Items in SCIDAR are protected by copyright, with all rights reserved, unless otherwise indicated.