加载中…
2021-10-23
On I-eigenvalue free threshold graphs
Luiz Emilio AllemElismar R. OliveiraFernando Tura
文献摘要
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讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本