Abstract

The Steinerk-eccentricity of a vertex v of a graph G is the maximum Steiner distance over all k-subsets of V(G) which contain v. In this paper Steiner 3-eccentricity is studied on trees. Some general properties of the Steiner 3-eccentricity of trees are given. A tree transformation which does not increase the average Steiner 3-eccentricity is given. As its application, several lower and upper bounds for the average Steiner 3-eccentricity of trees are derived.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call