On I-eigenvalue free threshold graphs

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 two algorithms for generating I-eigenvalue free threshold graphs.

arXiv comment23 figures, 23 pages

References in corpus (2)

• Eigenvalue location in cographs
• Spectral characterizations of anti-regular graphs