The distance spectrum of complements of trees

Let G be a connected graph of order n and D(G) be its distance matrix. In this paper, we characterize the unique graphs whose distance spectral radius attains the maximum and minimum among all complements of trees. Furthermore, we determine the unique graphs whose least distance eigenvalues attains the maximum and minimum among all complements of trees.