  A graph is said to be I-eigenvalue free if it has no eigenvalues in the
interval I with respect to the adjacency matrix A. In this paper we present two
algorithms for generating I-eigenvalue free threshold graphs.
