On graphs whose third largest distance eigenvalue dose not exceed -1
On graphs whose third largest distance eigenvalue dose not exceed -1
复制标题
DOI：
10.1016/j.amc.2021.126137
复制
发表时间：
2021
期刊：
影响因子：
--
通讯作者：
Jie Xue;Ruifang Liu;Jinlong Shu
中科院分区：
文献类型：
--
作者：
Jie Xue;Ruifang Liu;Jinlong Shu
本文讨论了链图的距离特征值。利用团扩张，我们刻画了所有第三大距离特征值至多为-1的连通图。作为应用，证明了如果一个图的第三大距离特征值小于-1，则该图是由它的距离谱决定的。
In this paper, the distance eigenvalues of chain graphs are discussed. Using clique extension, we characterize all connected graphs whose third largest distance eigenvalue is at most− 1. As an application, it is proved that a graph is determined by its distance spectrum if its third largest distance eigenvalue is less than− 1.