Generating $I$-Eigenvalue Free Threshold Graphs

  • Luiz Emilio Allem
  • Elismar R. Oliveira
  • Fernando Tura
DOI: https://doi.org/10.37236/11225

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.

Published
2023-05-19
How to Cite
Allem, L. E., R. Oliveira, E., & Tura, F. (2023). Generating $I$-Eigenvalue Free Threshold Graphs. The Electronic Journal of Combinatorics, 30(2), P2.30. https://doi.org/10.37236/11225
Issue
Volume 30, Issue 2 (2023)
Article Number
P2.30