共 50 条
The distance spectral radius of graphs with given independence number
被引:0
作者:
Lin, Huiqiu
[1
]
Feng, Lihua
[2
]
机构:
[1] E China Univ Sci & Technol, Dept Math, Shanghai 200092, Peoples R China
[2] Cent South Univ, Sch Math & Stat, Changsha 410083, Hunan, Peoples R China
来源:
关键词:
MAXIMAL ENERGY;
INDEX;
TREES;
MATRIX;
D O I:
暂无
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
Let D(G) be the distance matrix of a connected graph G. The distance spectral radius of G is the largest eigenvalue of D(G) and it has been proposed to be a molecular structure descriptor. In this paper, we study the distance spectral radius of graphs with given independence number. Special, attention is paid to the graphs given independence number and maximal distance spectral radius.
引用
收藏
页码:113 / 123
页数:11
相关论文
共 50 条