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

On the Distance Spectra of Extended Double Stars

Anuj Sakarda, Jerry Tan, Armaan Tipirneni

英文摘要:

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.

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

↑