Spectral graph theory is one of the important research fields of combinatorial ma-trix theory and graph theory, which mainly studies the adjacency spectrum, Laplacian spectrum and distance spectrum of a graph. In Chapter 1, we introduce some concepts, notations, and the main results obtained in this thesis. In Chapter 2, we character-ize graphs with minimum distance spectral radius among all connected n-graphs with given matching number. In Chapter 3, we calculate the distance spectra of G⊙K2 and G1□G2□G3.
|