论文标题

在延长双星星的距离光谱上

On the Distance Spectra of Extended Double Stars

论文作者

Sakarda, Anuj, Tan, Jerry, Tipirneni, Armaan

论文摘要

连接图的距离矩阵定义为条目是顶点之间成对距离的矩阵。图的距离光谱是其距离矩阵的特征值集。如果不存在具有相同频谱的非同态图,则据说图表由其距离频谱确定。过去提出了哪些图由它们的频谱决定的问题,但在很大程度上仍未解决。在本文中,我们证明了延伸的双星星由它们的距离光谱决定。

The distance matrix of a connected graph is defined as the matrix in which the entries are the pairwise distances between vertices. The distance spectrum of a graph is the set of eigenvalues of its distance matrix. A graph is said to be determined by its distance spectrum if there does not exist a non-isomorphic graph with the same spectrum. The question of which graphs are determined by their spectrum has been raised in the past, but it remains largely unresolved. In this paper, we prove that extended double stars are determined by their distance spectra.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源