Generating $I$-Eigenvalue Free Threshold Graphs
-
Published:2023-05-19
Issue:2
Volume:30
Page:
-
ISSN:1077-8926
-
Container-title:The Electronic Journal of Combinatorics
-
language:
-
Short-container-title:Electron. J. Combin.
Author:
Allem Luiz Emilio,R. Oliveira Elismar,Tura Fernando
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.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Threshold Graphs with an Arbitrary Large Gap Set;Bulletin of the Malaysian Mathematical Sciences Society;2024-04-08