arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1806.07260math.CO
收藏

特征值除两个外均为$2$或$-1$的图

The graphs with all but two eigenvalues equal to $2$ or $-1$

Jing Li, Deqiong Li, Yaoping Hou

摘要:

本文确定了所有邻接矩阵至多有两个特征值(包括重数)不同于$2$和$-1$的图。这些图归纳出了一类广义友谊图$F_{t,r,k}, $,它是完全图$K_t$的$k$副本在公共$r$顶点处相遇的图,使得$t-r=3.$由它的谱决定.

英文摘要:

In this paper, all graphs whose adjacency matrix has at most two eigenvalues (multiplicities included) different from $2$ and $-1$ are determined. These graphs conclude a class of generalized friendship graphs $F_{t,r,k}, $ which is the graph of $k$ copies of the complete graph $K_t$ meeting in common $r$ vertices such that $t-r=3.$ Which of these graphs are determined by its spectrum is are also obtained.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑