For a graph G = (V, E), the degree distance of G is defined as DD(G) = Sigma({u,v} subset of V(G)) (d(G)(u) + d(G)(v))d(G)(u,v) where d(G)(u) (or d(u)) is the degree of the vertex u in G, and d(G)(u, v) is the distance between u and v. Let B(n) be the set of bicyclic graph with n vertices. In this paper, we study the degree distance of B(n) by introducing grafting transformations, the lower bounds for DD(G) are determined. The corres...
