Distance Spectral Radius of Some k-partitioned Transmission Regular Graphs

摘要

The distance matrix of a simple graph G is D(G) = (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 λ_1(G), is the largest eigenvalue of D(G). We determine the distance spectral radius of the wheel graph W_n, a particular type of spider graphs, and the generalized Petersen graph P(n,k) for k∈ {2,3}.