Generating $I$-Eigenvalue Free Threshold Graphs

IF 0.7 4区数学 Q2 MATHEMATICS

Electronic Journal of Combinatorics Pub Date : 2023-05-19 DOI:10.37236/11225

Luiz Emilio Allem, Elismar R. Oliveira, Fernando Tura

引用次数: 0

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.

查看原文本刊更多论文

生成$I$-特征值自由阈值图

如果一个图相对于邻接矩阵A在区间I$内没有特征值，我们就说它是无特征值的。本文给出了生成$I$特征值无阈值图的两种算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Electronic Journal of Combinatorics 数学-数学

CiteScore

1.30

自引率

14.30%

发文量

212

审稿时长

3-6 weeks

期刊介绍： The Electronic Journal of Combinatorics (E-JC) is a fully-refereed electronic journal with very high standards, publishing papers of substantial content and interest in all branches of discrete mathematics, including combinatorics, graph theory, and algorithms for combinatorial problems.