Generating I-eigenvalue free threshold graphs

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. © 2023, Australian National University. All rights reserved.

Bibliographic Details
Main Authors: Allem, L.E (Author), Oliveira, E.R (Author), Tura, F. (Author)
Format: Article
Language:English
Published: Australian National University 2023
Online Access:View Fulltext in Publisher
View in Scopus

Similar Items