Degree distance of unicyclic graphs
Degree distance of unicyclic graphs
The degree distance of a connected graph G with vertex set V(G) is defined as D'(G)= ?u?V (G) dG (u)DG (u), where dG (u) denotes the degree of vertex u and DG (u) denotes the sum of distances between u and all vertices of G. We determine the maximum degree …