On I-eigenvalue free threshold graphs

2021/10/23 by Allem, Luiz Emilio, Oliveira, Elismar R., Tura, Fernando
#Combinatorics (math.CO) #FOS: Mathematics #Spectral Theory (math.SP)

paper · doi:10.48550/arxiv.2110.12107

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.

Related

• Eigenvalue-free interval for threshold graphs
• The minimum number of distinct eigenvalues of a threshold graph is at most 4
• The smallest eigenvalue of K_p-free graphs
• More on Equienergetic Threshold Graphs
• A conjecture of eigenvalues of threshold graphs