A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Some Graphs Determined By Their Distance Spectrum
The Electronic Journal of Linear Algebra
Let G be a connected graph with order n. Let λ 1 (D(G)) ≥ · · · ≥ λn(D(G)) be the distance spectrum of G. In this paper, it is shown that the complements of Pn and Cn are determined by their D-spectrum. Moreover, it is shown that the cycle Cn (n odd) is also determined by its D-spectrum.doi:10.13001/1081-3810.3613 fatcat:cll7lkdmhrgehpco6y4ns4ni5i