The minimum spectral radius of graphics with a given clique number

被引:0
作者
Stevanovic, Dragan [1 ,2 ]
Hansen, Pierre [3 ,4 ]
机构
[1] Univ Primorska, FAMNIT, Koper, Slovenia
[2] Univ Nis, PMF, Nish, Serbia
[3] GERAD, Montreal, PQ, Canada
[4] HEC Montreal, Montreal, PQ, Canada
关键词
adjacency matrix; largest eigenvalue; spectral radius; clique number; kite graph;
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In this paper, it is shown that among connected graphs with maximum clique size omega, the minimum value of the spectral radius of adjacency matrix is attained for a kite graph PKn-omega,omega, which consists of a complete graph K-omega to a vertex of which a path Pn-omega is attached. For any fixed omega, a small interval to which the spectral radii of kites PKm,omega, m >= 1, belong is exhibited.
引用
收藏
页码:110 / 117
页数:8
相关论文
共 15 条