论文信息 - On the least distance eigenvalue of a graph

On the least distance eigenvalue of a graph

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 ] .

Guanglong Yu

[1] D. Cvetkovic,et al. Spectra of Graphs: Theory and Applications , 1997 .

[2] Gopalapillai Indulal,et al. The distance spectrum and energy of the compositions of regular graphs , 2009, Appl. Math. Lett..

[3] Bo Zhou,et al. On Distance Spectral Radius and Distance Energy of Graphs , 2010 .

[4] Vladimir Nikiforov,et al. The smallest eigenvalue of the signless Laplacian , 2011 .

[5] Aleksandar Ilic,et al. Distance spectral radius of trees with fixed maximum degree , 2010 .

[6] Aleksandar Ilic,et al. Distance spectral radius of trees with given matching number , 2010, Discret. Appl. Math..

[7] Dejan Plavšić,et al. The distance matrix in chemistry , 1992 .

[8] Dragoš Cvetković,et al. A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph , 2008 .

[9] Yi-Zheng Fan,et al. Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread , 2008 .

[10] D. Cvetkovic,et al. Graphs for which the least eigenvalue is minimal, II , 2008 .