Graphs with all but two eigenvalues in [-2, 0].

Nair Abreu,Jorge Alencar,André Ebling Brondani,Leonardo Silva de Lima,Carla Silva Oliveira

DISCUSSIONES MATHEMATICAE GRAPH THEORY（2020）

引用 0|浏览24

暂无评分

摘要

The eigenvalues of a graph are those of its adjacency matrix. Recently, Cioaba, Haemers and Vermette characterized all graphs with all but two eigenvalues equal to -2 and 0. In this article, we extend their result by characterizing explicitly all graphs with all but two eigenvalues in the interval [-2, 0]. Also, we determine among them those that are determined by their spectrum.

查看译文

关键词

graph spectrum,complete multipartite graph,graph determined by its spectrum

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要