关于Graham和Lovász的一个简短评论的简短说明
A short note on a short remark of Graham and Lovász
摘要:
设D是连通图G的距离矩阵,nn(G),np(G)分别是D的严格负特征值和严格正特征值的个数.文[1]曾指出,不知道是否存在一个图使np(G)> nn(G)。本文证明了存在无穷多个满足上述不等式的图,即阶数> 9的会议图。这类图的一个很大的代表是Paley图,这个结果是通过导出强正则图的距离矩阵的特征值得到的。
英文摘要:
Let D be the distance matrix of a connected graph G and let nn(G), np(G) be the number of strictly negative and positive eigenvalues of D respectively. It was remarked in [1] that it is not known whether there is a graph for which np(G) > nn (G). In this note we show that there exists an infinite number of graphs satisfying the stated inequality, namely the conference graphs of order> 9. A large representative of this class being the Paley graphs.The result is obtained by derving the eigenvalues of the distance matrix of a strongly-regular graph.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。