On I-eigenvalue free threshold graphs
Luiz Emilio Allem, Elismar R. Oliveira, Fernando Tura
TL;DR
This paper introduces two algorithms to generate threshold graphs that do not have eigenvalues within a specified interval, contributing to spectral graph theory by providing tools for constructing such graphs.
Contribution
The paper presents novel algorithms specifically designed to generate I-eigenvalue free threshold graphs, advancing methods in spectral graph construction.
Findings
Algorithms successfully generate I-eigenvalue free threshold graphs
The methods improve control over spectral properties of threshold graphs
Potential applications in network design and spectral analysis
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 two algorithms for generating I-eigenvalue free threshold graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Advanced Graph Theory Research · Topological and Geometric Data Analysis