Let G be a finite connected graph of order n, minimum degree δ and diameter d. The degree distance D′(G) of G is defined as ∑{u,v}⊆V(G)(degu+degv)d(u,v), where degw is the degree of vertex w and d(u,v) denotes the distance between u and v. In this paper, we find an asymptotically sharp upper bound on the degree distance in terms of order, minimum degree and diameter. In particular, we prove that D′(G)≤41dn(n−3d(δ+1))2+O(n3).
As a corollary, we obtain the bound D′(G)≤9(δ+1)n4+O(n3) for a graph G of order n and minimum degree δ. This result, apart from improving on a result of Dankelmann, Gutman, Mukwembi and Swart [3] for graphs of given order and minimum degree, settles a conjecture of Tomescu [14] completely.
Let G be a finite connected graph of order n, minimum degree δ and diameter d. The degree distance D′(G) of G is defined as ∑{u,v}⊆V(G)(degu+degv)d(u,v), where degw is the degree of vertex w and d(u,v) denotes the distance between u and v. In this paper, we find an asymptotically sharp upper bound on the degree distance in terms of order, minimum degree and diameter. In particular, we prove that D′(G)≤41dn(n−3d(δ+1))2+O(n3).
As a corollary, we obtain the bound D′(G)≤9(δ+1)n4+O(n3) for a graph G of order n and minimum degree δ. This result, apart from improving on a result of Dankelmann, Gutman, Mukwembi and Swart [3] for graphs of given order and minimum degree, settles a conjecture of Tomescu [14] completely.
doi:10.1017/S000497271200035