DC FieldValueLanguage
dc.contributor.authorBelardo, Francescoen
dc.contributor.authorLi Marzi, Enzoen
dc.contributor.authorSimić, Slobodanen
dc.contributor.authorWang, Jianfengen
dc.date.accessioned2020-05-01T20:12:49Z-
dc.date.available2020-05-01T20:12:49Z-
dc.date.issued2010-04-15en
dc.identifier.issn0024-3795en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1151-
dc.description.abstractWe consider the set of unicyclic graphs with prescribed degree sequence. In this set we determine the (unique) graph with the largest spectral radius (or index) with respect to the adjacency matrix. In addition, we give a conjecture about the (unique) graph with the largest index in the set of connected graphs with prescribed degree sequence.en
dc.publisherElsevier-
dc.relationSerbian Ministry for Science (Grant 144015G)-
dc.relationNational Science Foundation of China (No. 10761008)-
dc.relation.ispartofLinear Algebra and Its Applicationsen
dc.subjectAdjacency spectrum | Degree sequence | Graph index | Largest eigenvalue | Spectral radiusen
dc.titleOn the spectral radius of unicyclic graphs with prescribed degree sequenceen
dc.typeArticleen
dc.identifier.doi10.1016/j.laa.2009.06.008en
dc.identifier.scopus2-s2.0-77149175451en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage2323en
dc.relation.lastpage2334en
dc.relation.issue9en
dc.relation.volume432en
dc.description.rankM22-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.grantfulltextnone-
Show simple item record

SCOPUSTM   
Citations

26
checked on Mar 6, 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.