Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/762| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Koledin, Tamara | en_US |
| dc.contributor.author | Stanić, Zoran | en_US |
| dc.date.accessioned | 2022-08-15T15:00:15Z | - |
| dc.date.available | 2022-08-15T15:00:15Z | - |
| dc.date.issued | 2013-01-01 | - |
| dc.identifier.issn | 14505444 | en |
| dc.identifier.uri | https://research.matf.bg.ac.rs/handle/123456789/762 | - |
| dc.description.abstract | Regular graphs whose second largest eigenvalue (i.e. λ2) is at most 1 are considered. Some structural properties of these graphs are obtained, and all these graphs with λ2 ≤ 1 of degree at most 8 are determined. | en |
| dc.publisher | Novi Sad : Prirodno-matematički fakultet, Departman za matematiku i informatiku | en_US |
| dc.relation.ispartof | Novi Sad Journal of Mathematics | en_US |
| dc.subject | Graph spectrum | en |
| dc.subject | Regular graphs | en |
| dc.subject | Second largest eigenvalue | en |
| dc.title | Regular graphs whose second largest eigenvalue is at most 1 | en_US |
| dc.type | Article | en_US |
| dc.identifier.scopus | 2-s2.0-84885818403 | - |
| dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/84885818403 | - |
| dc.contributor.affiliation | Numerical Mathematics and Optimization | en_US |
| dc.relation.issn | 1450-5444 | en_US |
| dc.description.rank | M51 | en_US |
| dc.relation.firstpage | 145 | en_US |
| dc.relation.lastpage | 153 | en_US |
| dc.relation.volume | 43 | en_US |
| dc.relation.issue | 1 | en_US |
| item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
| item.cerifentitytype | Publications | - |
| item.openairetype | Article | - |
| item.grantfulltext | none | - |
| item.fulltext | No Fulltext | - |
| crisitem.author.orcid | 0000-0002-4949-4203 | - |
| Appears in Collections: | Research outputs | |
SCOPUSTM
Citations
10
checked on Apr 1, 2026
Page view(s)
12
checked on Jan 19, 2025
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.