Generating I-eigenvalue free threshold graphs

DOI10.37236/11225MaRDI QIDQ6162138zbMATH OpenFDO

Authors Luiz Emilio Allem, Elismar R. Oliveira, Fernando Colman Tura

Publication date 15 June 2023

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2110.12107

zbMATH Keywords

cotreesinertia of a graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

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.

Review text

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.

Recommendations

• Eigenvalue-free interval for threshold graphs
• Eigenvalue-free interval for Seidel matrices of threshold graphs
• A note on the eigenvalue free intervals of some classes of signed threshold graphs
• Eigenvalue-free intervals of distance matrices of threshold and chain graphs
• Eigenvalue location in threshold graphs

Cites work

• A Graph-Theoretic Characterization of the $\text{PV}_{\text{chunk}}$ Class of Synchronizing Primitives
• Eigenvalue location in cographs
• Eigenvalue-free interval for threshold graphs
• Eigenvalues and energy in threshold graphs
• scientific article; zbMATH DE number 3465473 (Why is no real title available?)
• scientific article; zbMATH DE number 3598234 (Why is no real title available?)
• Interlacing results on matrices associated with graphs
• Limit points of eigenvalues of (di)graphs
• On the distribution of the maximum eigenvalues of graphs
• On the spectrum of threshold graphs
• Some notes on spectra of cographs.
• Spectral characterizations of anti-regular graphs
• Threshold graphs and related topics

Cited in

(4)

• Threshold Graphs with an Arbitrary Large Gap Set
• Laplacian eigenvalues of weighted threshold graphs
• Eigenvalue-free interval for Seidel matrices of cographs
• Spectral properties of \(\mathcal{C}\)-graphs

This page was built for publication: Generating \(I\)-eigenvalue free threshold graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6162138)