Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6416545 | Linear Algebra and its Applications | 2013 | 6 Pages |
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
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
Guanglong Yu,