1. Research with MATF
  2. MATF
  3. Research outputs
Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/742
DC FieldValueLanguage
dc.contributor.authorStanić, Zoranen_US
dc.date.accessioned2022-08-15T15:00:13Z-
dc.date.available2022-08-15T15:00:13Z-
dc.date.issued2010-07-01-
dc.identifier.issn03081087en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/742-
dc.description.abstractWe characterize all regular graphs whose second largest eigenvalue does not exceed 1. In the sequel, we determine all coronas, different from cones, with the same property. Some results and examples regarding unsolved cases are also given. © 2010 Taylor & Francis.en_US
dc.language.isoenen_US
dc.publisherTaylor and Francisen_US
dc.relation.ispartofLinear and Multilinear Algebraen_US
dc.subjectAdjacency matrixen_US
dc.subjectCoronasen_US
dc.subjectRegular graphsen_US
dc.subjectSecond largest eigenvalueen_US
dc.titleOn regular graphs and coronas whose second largest eigenvalue does not exceed 1en_US
dc.typeArticleen_US
dc.identifier.doi10.1080/03081080802648814-
dc.identifier.scopus2-s2.0-77954247808-
dc.identifier.isi000279613900002-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/77954247808-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.issn0308-1087en_US
dc.description.rankM21en_US
dc.relation.firstpage545en_US
dc.relation.lastpage554en_US
dc.relation.volume58en_US
dc.relation.issue5en_US
item.openairetypeArticle-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.languageiso639-1en-
item.grantfulltextnone-
crisitem.author.deptNumerical Mathematics and Optimization-
crisitem.author.orcid0000-0002-4949-4203-
Appears in Collections:Research outputs
Show simple item record

SCOPUSTM   
Citations

22
checked on Mar 27, 2025

Page view(s)

15
checked on Jan 19, 2025

Google ScholarTM

Check

Altmetric

Altmetric


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