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
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.