On the average Steiner 3-eccentricity of trees (Q2231759)

The Steiner \(k\)-eccentricity of a vertex \(v\) of a graph \(G\) is the maximum Steiner distance over all \(k\)-subsets of \(V(G)\) which contain \(v\). That is, ecc\(_{k}(v, G) = \max \{d_{G}(S) : v \in S \subseteq V(G), |S| = k\}\), where \(d_{G}(S)\) is the Steiner distance of \(S\). The average Steiner \(k\)-eccentricity aecc\(_{k}(G)\) of \(G\) as the mean value of Steiner \(k\)-eccentricities of all vertices in \(G\). In this paper, the authors introduced the notion of average Steiner \(k\)-eccentricity in graphs and the Steiner \(3\)-eccentricity is studied on trees. Some general properties of the average 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. The paper is highly motivating as this notion of average Steiner \(k\)-eccentricity is an interesting topological index related to Steiner distances. with possible applications to mathematical chemistry and other areas.