arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.02522math.CO
收藏

至多有两个特征值不等于$\pm 1$的符号图

On signed graphs with at most two eigenvalues unequal to $\pm 1$

Willem H. Haemers, Hatice Topcu

摘要:

我们提出的第一个步骤,对确定的符号图的邻接矩阵的所有,但最多有两个特征值等于1或-1。在这里,我们处理的不连通,二部和完全签署的图。此外,我们提出了许多例子,不能从一个无符号图或其负面的开关。

英文摘要:

We present the first steps towards the determination of the signed graphs for which the adjacency matrix has all but at most two eigenvalues equal to 1 or -1. Here we deal with the disconnected, the bipartite and the complete signed graphs. In addition, we present many examples which cannot be obtained from an unsigned graph or its negative by switching.

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

↑