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.
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
-
A note on the eigenvalue free intervals of some classes of signed threshold graphs
by: Anđelić Milica, et al.
Published: (2019-12-01) -
The study of triangle-free graphs by interlacing theorem for eigenvalues
by: 蘇慧文
Published: (2012) -
Higher eigenvalues of graphs
by: Price, Gregory N., et al.
Published: (2010) -
Bounds of Eigenvalues of K3,3-Minor Free Graphs
by: Kun-Fu Fang
Published: (2009-01-01) -
On the eigenvalues of firefly graphs
by: Hong Wenxi, et al.
Published: (2014-09-01)