Sharp bounds on distance spectral radius of graphs

被引:5
|
作者
Lin, Huiqiu [1 ]
Shu, Jinlong [1 ]
机构
[1] E China Normal Univ, Dept Math, Shanghai 200062, Peoples R China
来源
LINEAR & MULTILINEAR ALGEBRA | 2013年 / 61卷 / 04期
基金
中国国家自然科学基金;
关键词
distance spectral radius; average distance degree; pseudo distance regular; 05C50; LARGEST EIGENVALUE; MATRIX; NUMBER; TREE;
D O I
10.1080/03081087.2012.689984
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Let D(G) denote the distance matrix of a connected graph G. The largest eigenvalue of D(G) is called the distance spectral radius of a graph G, denoted by ?(G). In this article, we give sharp upper and lower bounds for the distance spectral radius and characterize those graphs for which these bounds are best possible.
引用
收藏
页码:442 / 447
页数:6
相关论文
共 50 条