Learn More
Let G be a finite connected graph. The degree distance D (G) of G is defined as {u,v}⊆V (G) (deg u + deg v) d G (u, v), where deg w is the degree of vertex w and d G (u, v) denotes the distance between u and v in G. In this paper, we give asymptotically sharp upper bounds on the degree distance in terms of order and edge-connectivity.
  • 1