Generating \(I\)-eigenvalue free threshold graphs (Q6162138)
From MaRDI portal
scientific article; zbMATH DE number 7696235
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generating \(I\)-eigenvalue free threshold graphs |
scientific article; zbMATH DE number 7696235 |
Statements
Generating \(I\)-eigenvalue free threshold graphs (English)
0 references
15 June 2023
0 references
Summary: 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.
0 references
cotrees
0 references
inertia of a graph
0 references
0 references
