The distance matrix of a simple graph G is D(G) = (di,j), where di,j is the distance between the ith and jth vertices of G. The distance spectral radius of G, written λ1(G), is the largest eigenvalue of D(G). We determine the distance spectral radius of the wheel graph Wn, a particular type of spider graphs, and the generalized Petersen graph P(n, k) for k ∈ {2, 3}.