On the least distance eigenvalue of a graph
On the least distance eigenvalue of a graph
复制标题
DOI：
10.1016/j.laa.2013.06.029
复制
发表时间：
2013-10
影响因子：
1.1
通讯作者：
Guanglong Yu
中科院分区：
文献类型：
--
作者：
Guanglong Yu
设n阶连通图G的距离矩阵为D（G）=（di，j）n× n，其中di j等于G中顶点vi与vj之间的距离。D（G）的最小特征值称为G的最小距离特征值，记为λ n。本文确定了所有λ n∈[-2.383，0]的图。
Abstract Denote by D (G)=(d i, j) n× n the distance matrix of a connected graph G with n vertices, where d i j is equal to the distance between vertices v i and v j in G. The least eigenvalue of D (G) is called the least distance eigenvalue of G, denoted by λ n. In this paper, we determine all the graphs with λ n∈[− 2.383, 0].