On graphs whose third largest distance eigenvalue dose not exceed −1

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