Generating $I$-Eigenvalue Free Threshold Graphs
Luiz Emílio Allem, Elismar R. Oliveira, Fernando Tura · The Electronic Journal of Combinatorics · 2023
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 twoalgorithms for generating $I$-eigenvalue free threshold graphs.