The distance spectrum of complements of trees
The distance spectrum of complements of trees
复制标题
树的补集的距离谱
DOI:
10.1016/j.laa.2017.05.016
复制
发表时间:
2017-10
影响因子:
1.1
通讯作者:
Stephen Drury
中科院分区:
文献类型:
--
作者:
Huiqiu Lin;Stephen Drury
Let G be a connected graph of order n and D (G) be its distance matrix. In this paper, we characterize the unique graphs whose distance spectral radius attains the maximum and minimum among all complements of trees. Furthermore, we determine the unique graphs whose least distance eigenvalues attains the maximum and minimum among all complements of trees.
登录
查看更多内容
影响因子:
1.1
作者:
W. So
通讯作者:
W. So
DOI:
10.1007/1-4020-2721-4_1
发表时间:
2011-04
期刊:
--
影响因子:
--
作者:
B. Ya
通讯作者:
B. Ya
影响因子:
1.1
作者:
Guanglong Yu
通讯作者:
Guanglong Yu
影响因子:
1.1
作者:
D. Hershkowitz;V. Mehrmann;H. Schneider
通讯作者:
D. Hershkowitz;V. Mehrmann;H. Schneider
影响因子:
1.1
作者:
Jin, Ya-Lei;Zhang, Xiao-Dong
通讯作者:
Zhang, Xiao-Dong