The minimum spectral radius of graphs with a given clique number

DC Field	Value	Language
dc.contributor.author	Stevanović, Dragan	en
dc.contributor.author	Hansen, Pierre	en
dc.date.accessioned	2020-05-01T20:13:04Z	-
dc.date.available	2020-05-01T20:13:04Z	-
dc.date.issued	2008-03-01	en
dc.identifier.issn	1081-3810	-
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/1294	-
dc.description.abstract	In 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.publisher	International Linear Algebra Society	-
dc.relation	Serbian Ministry of Science and Environmental Protection, grant 144015G	-
dc.relation	Slovenian Agency for Research, program P1-0285	-
dc.relation.ispartof	Electronic Journal of Linear Algebra	en
dc.subject	Adjacency matrix \| Clique number \| Kite graph \| Largest eigenvalue \| Spectral radius	en
dc.title	The minimum spectral radius of graphs with a given clique number	en
dc.type	Article	en
dc.identifier.scopus	2-s2.0-40849118676	en
dc.relation.firstpage	110	en
dc.relation.lastpage	117	en
dc.relation.volume	17	en
dc.description.rank	M22	-
item.cerifentitytype	Publications	-
item.openairetype	Article	-
item.grantfulltext	none	-
item.fulltext	No Fulltext	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
crisitem.author.orcid	0000-0003-2908-305X	-

27

checked on Dec 26, 2024

25

checked on Dec 26, 2024

Check