On Distance Spectral Radius and Distance Energy of Graphs
On Distance Spectral Radius and Distance Energy of Graphs
复制标题
DOI：
--
复制
发表时间：
2011-01
期刊：
影响因子：
--
通讯作者：
Bo Zhou;Aleksandar Ilić
中科院分区：
文献类型：
--
作者：
Bo Zhou;Aleksandar Ilić
对于连通图，距离谱半径是其距离矩阵的最大特征值，距离能量定义为其距离矩阵特征值的绝对值之和。建立了图和二部图的距离谱半径的下界和上界，图的距离能量的下界，并对极值图进行了刻画。我们还讨论了距离能量的上界。
For a connected graph, the distance spectral radius is the largest eigenvalue of its distance matrix, and the distance energy is defined as the sum of the absolute values of the eigenvalues of its distance matrix. We establish lower and upper bounds for the distance spectral radius of graphs and bipartite graphs, lower bounds for the distance energy of graphs, and characterize the extremal graphs. We also discuss upper bounds for the distance energy.