Extremal values on the eccentric distance sum of trees

Abstract: Let

G = (V_{G}, E_{G})

be a simple connected graph. The eccentric distance sum of

G

is defined as

x i^{d} (G) = s u m_{v i n V_{G}} v a r e p s i l o n_{G} (v) D_{G} (v)

, where

v a r e p s i l o n_{G} (v)

is the eccentricity of the vertex

v

and

D_{G} (v) = s u m_{u i n V_{G}} d_{G} (u, v)

is the sum of all distances from the vertex

v

. In this paper the tree among

n

-vertex trees with domination number

g a m m a

having the minimal eccentric distance sum is determined and the tree among

n

-vertex trees with domination number

g a m m a

satisfying

n = k g a m m a

having the maximal eccentric distance sum is identified, respectively, for

k = 2, 3, f r a c n 3, f r a c n 2

. Sharp upper and lower bounds on the eccentric distance sums among the

n

-vertex trees with

k

leaves are determined. Finally, the trees among the

n

-vertex trees with a given bipartition having the minimal, second minimal and third minimal eccentric distance sums are determined, respectively.

Recommendations

Cites work

Cited in

(45)

This page was built for publication: Extremal values on the eccentric distance sum of trees