We present an algorithm for constructing the characteristic polynomial of a threshold graph’s adjacency matrix. The algorithm is based on a diagonalization procedure that is easy to describe. It can be implemented using ...