Let G be a simple, connected graph, D(G) be the distance matrix of G, and T r(G) be the diagonal matrix of vertex transmissions of G. The distance Laplacian matrix and distance signless Laplacian matrix of G are defined byand the generalized distance spectral radius of G is the largest eigenvalue of D α (G). In this paper, we give a complete description of the D−spectrum, L−spectrum and Q−spectrum of some graphs obtained by operations. In addition, we present some new upper and lower bounds on the generalized distance spectral radius of G and of its line graph L(G), based on other graph-theoretic parameters, and characterize the extremal graphs. Finally, we study the generalized distance spectrum of some composite graphs.