On the least distance eigenvalue of a graph |
| |
Authors: | Guanglong Yu |
| |
Institution: | Department of Mathematics, Yancheng Teachers University, Yancheng, 224002, Jiangsu, PR China |
| |
Abstract: | Denote by D(G)=(di,j)n×n the distance matrix of a connected graph G with n vertices, where dij is equal to the distance between vertices vi and vj 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]. |
| |
Keywords: | 05C50 |
本文献已被 ScienceDirect 等数据库收录! |
|