Let G be a graph with n vertices, and let denote the degree of vertex u in The maximum degree matrix of G is the square matrix of order n whose -entry is equal to if vertices u and v are adjacent in G, and zero otherwise. Let be the graph obtained from the complete graph by removing an edge , and identifying vertices u and v with the end vertices and of the paths and , respectively. Let denote the set of simple, connected graphs with n vertices and diameter d. A graph in that attains the largest spectral radius of the maximum degree matrix is called a maximizing graph. In this paper, we first characterize the spectrum of the maximum degree matrix for graphs of the form , where . Furthermore, for we prove that the maximizing graph in is Finally, if is an even integer, then the spectral radius of the maximum degree matrix in can be computed as the largest eigenvalue of a symmetric tridiagonal matrix of order .