On I-eigenvalue free threshold graphs
Combinatorics
2021-10-26 v1 Spectral Theory
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.
Keywords
Cite
@article{arxiv.2110.12107,
title = {On I-eigenvalue free threshold graphs},
author = {Luiz Emilio Allem and Elismar R. Oliveira and Fernando Tura},
journal= {arXiv preprint arXiv:2110.12107},
year = {2021}
}
Comments
23 figures, 23 pages