The Steiner k-eccentricity on trees

We study the Steiner $k$-eccentricity on trees, which generalizes the previous one in the paper [X.~Li, G.~Yu, S.~Klavžar, On the average Steiner 3-eccentricity of trees, arXiv:2005.10319, 2020]. To support the algorithm, we achieve much stronger properties for the Steiner $k$-ecc tree than that in the previous paper. Based on this, a linear time algorithm is devised to calculate the Steiner $k$-eccentricity of a vertex in a tree. On the other hand, the lower and upper bounds of the average Steiner $k$-eccentricity index of a tree on order $n$ are established based on a novel technique which is quite different from that in the previous paper but much easier to follow.

[1]  Ortrud R. Oellermann,et al.  On the Average Steiner Distance of Graphs with Prescribed Properties , 1997, Discret. Appl. Math..

[2]  Daniel Weißauer,et al.  Isometric subgraphs for Steiner distance , 2020, J. Graph Theory.

[3]  D. West.  Introduction to Graph Theory , 1995 .

[4]  Gary Chartrand,et al.  Steiner distance in graphs , 1989 .

[5]  Xueliang Li,et al.  The Steiner Wiener Index of A Graph , 2016, Discuss. Math. Graph Theory.

[6]  Xun Chen,et al.  A sharp lower bound on Steiner Wiener index for trees with given diameter , 2018, Discret. Math..

[7]  F. Hwang,et al.  The Steiner Tree Problem , 2012 .

[8]  P. Dankelmann,et al.  The Average Eccentricity of a Graph and its Subgraphs , 2022 .

[9]  Ivan Gutman,et al.  On Steiner degree distance of trees , 2016, Appl. Math. Comput..

[10]  Zhao Wang,et al.  Steiner Distance in Join, Corona and Threshold Graphs , 2017, 2017 14th International Symposium on Pervasive Systems, Algorithms and Networks & 2017 11th International Conference on Frontier of Computer Science and Technology & 2017 Third International Symposium of Creative Computing (ISPAN-FCST-ISCC).

[11]  Sandi Klavzar,et al.  On the average Steiner 3-eccentricity of trees , 2021, Discret. Appl. Math..

[12]  Zhao Wang,et al.  Steiner Distance in Product Networks , 2017, Discret. Math. Theor. Comput. Sci..

[14]  Xueliang Li,et al.  Steiner (revised) Szeged index of graphs , 2019, 1905.13621.

[15]  Peter Dankelmann,et al.  Upper bounds on the average eccentricity , 2014, Discret. Appl. Math..

[16]  Ortrud R. Oellermann,et al.  The average Steiner distance of a graph , 1996, J. Graph Theory.

[17]  Xueliang Li,et al.  Multicenter Wiener indices and their applications , 2015 .

[18]  Y. Mao.  Steiner Distance in Graphs--A Survey , 2017, 1708.05779.

[19]  Aleksandar Ilic,et al.  On the extremal properties of the average eccentricity , 2011, Comput. Math. Appl..

[20]  Ortrud R. Oellermann,et al.  on the Steiner Median of a Tree , 1996, Discret. Appl. Math..

[21]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[22]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[23]  Niko Tratnik.  On the Steiner hyper-Wiener index of a graph , 2018, Appl. Math. Comput..

[24]  Xueliang Li,et al.  Inverse Problem on the Steiner Wiener Index , 2018, Discuss. Math. Graph Theory.

[25]  Sandi Klavzar,et al.  Convex Sets in Lexicographic Products of Graphs , 2012, Graphs Comb..