The distance matrix of a simple graph G is $$DG=d_{i,j}$$, where $$d_{i,j}$$ is the distance between the ith and jth vertices of G. The distance spectral radius of G, written $$\lambda _{1}G$$, is the largest eigenvalue of DG. We determine the distance spectral radius of the wheel graph $$W_{n}$$, a particular type of spider graphs, and the generalized Petersen graph Pn,i¾źk for $$k\in \{2,3\}$$.
['Fouzul Atik', 'Pratima Panigrahi']
Distance Spectral Radius of Some k-partitioned Transmission Regular Graphs