Complete multipartite graphs are determined by their distance spectra

2013/07/23 by Ya-Lei Jin, Xiao-Dong Zhang, Jin, Ya-Lei +1
Mathematics · #05C50 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05C50

paper · pdf · doi:10.48550/arxiv.1307.5931

8 pages

arxiv created 2013/07/23 · arxiv updated 2013/07/24

Abstract

It is well known that the complete multipartite graphs can not be determined by their adjacency spectra. But in this paper, we prove that they can be determined by their distance spectra, which confirms the conjecture proposed by Lin, Hong, Wang and Shu.

Related

• Spectral characterizations of two families of nearly complete bipartite graphs
• On the Distance Spectra of Extended Double Stars
• On conjectures of network distance measures by using graph spectra
• The graphs with all but two eigenvalues equal to ± 1
• Some Spectral and Quasi-Spectral Characterizations of Distance-Regular Graphs