The distance spectrum of a tree

Let T be a tree with line graph T*. Define K = 2I + A(T*), where A denotes the adjacency matrix. Then the eigenvalues of -2K^?1 interlace the eigenvalues of the distance matrix D. This permits numerous results about the spectrum of K to be transcribed for the less tractable D.