共 50 条
Clique number and distance spectral radii of graphs
被引:0
|作者:
Zhai, Mingqing
[1
,2
]
Yu, Guanglong
[3
]
Shu, Jinlong
[3
]
机构:
[1] Nanjing Normal Univ, Sch Math Sci, Nanjing 210046, Jiangsu, Peoples R China
[2] Chuzhou Univ, Dept Math, Chuzhou 239012, Anhui, Peoples R China
[3] E China Normal Univ, Dept Math, Shanghai 200241, Peoples R China
来源:
关键词:
Graph;
Clique number;
Distance spectral radius;
LARGEST EIGENVALUE;
MATRIX;
D O I:
暂无
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
The distance spectral radius of a connected graph G, denoted by rho(G), is the maximal eigenvalue of the distance matrix of G. In this paper we find a sharp lower bound as well as a sharp upper bound of rho(G) in terms of omega(G), the clique number of G. Furthermore, both extremal graphs are unique decided.
引用
收藏
页码:385 / 392
页数:8
相关论文