DC FieldValueLanguage
dc.contributor.authorStevanović, Draganen
dc.contributor.authorHansen, Pierreen
dc.date.accessioned2020-05-01T20:13:04Z-
dc.date.available2020-05-01T20:13:04Z-
dc.date.issued2008-03-01en
dc.identifier.issn1081-3810-
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1294-
dc.description.abstractIn this paper, it is shown that among connected graphs with maximum clique size ω, the minimum value of the spectral radius of adjacency matrix is attained for a kite graph PKn-ω,ω, which consists of a complete graph Kω to a vertex of which a path P n-ω is attached. For any fixed ω, a small interval to which the spectral radii of kites PKm,ω, m ≥ 1, belong is exhibited.en
dc.publisherInternational Linear Algebra Society-
dc.relationSerbian Ministry of Science and Environmental Protection, grant 144015G-
dc.relationSlovenian Agency for Research, program P1-0285-
dc.relation.ispartofElectronic Journal of Linear Algebraen
dc.subjectAdjacency matrix | Clique number | Kite graph | Largest eigenvalue | Spectral radiusen
dc.titleThe minimum spectral radius of graphs with a given clique numberen
dc.typeArticleen
dc.identifier.scopus2-s2.0-40849118676en
dc.relation.firstpage110en
dc.relation.lastpage117en
dc.relation.volume17en
dc.description.rankM22-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0003-2908-305X-
Show simple item record

SCOPUSTM   
Citations

27
checked on Apr 18, 2024

Page view(s)

38
checked on Apr 16, 2024

Google ScholarTM

Check


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