  A threshold graph G on n vertices is defined by binary sequence of length n.
In this paper we present an explicit formula for computing the distance
characteristic polynomial of a threshold graph from its binary sequence. As
application, we show a several of nonisomorphic pairwise threshold graphs which
are {D}-cospectral graphs.
