The degree distance of a connected graph G with vertex set V(G) is defined as $\sum\limits_{u \in V\left( G \right)} {{d_G}} \left( u \right){D_G}\left( u \right)$, where dG(u) is the degree of vertex ...

In this paper, motivated by the study of the wide diameter and the Rabin number of graphs, we define the generalized k-diameter of k-connected graphs, and show that every k-regular k-connected graph ...