Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have