  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 characteristic
polynomial of a threshold graph from its binary sequence. Applications include
obtaining a formula for the determinant of adjacency matrix of a threshold
graph and showing that no two nonisomorphic threshold graphs are cospectral.
