  The distance matrix of a connected graph is defined as the matrix in which
the entries are the pairwise distances between vertices. The distance spectrum
of a graph is the set of eigenvalues of its distance matrix. A graph is said to
be determined by its distance spectrum if there does not exist a non-isomorphic
graph with the same spectrum. The question of which graphs are determined by
their spectrum has been raised in the past, but it remains largely unresolved.
In this paper, we prove that extended double stars are determined by their
distance spectra.
