Research on Some Conclusions of the Distance Spectrum of a Graph

摘要

This paper studies some graph distance spectrum, first introduces the basic concepts that used in this article, and related terms and the main results obtained mark in this paper. At the same time the paper depicts the matching number is β, order number is n that has minimum distance spectral radius of graph in all connected graph. The article finally calculated the distance spectrum of G⊙K2 and G_1 G_2 G_3.