论文标题
Steiner $ k $ - 树木的居中
The Steiner $k$-eccentricity on trees
论文作者
论文摘要
我们在树上研究了steiner $ k $ centricity，它在论文[X.〜i li，G。yu，S.为了支持该算法，我们为Steiner $ k $ -ECC树获得了比上一篇论文的属性要强得多。基于此，设计了一种线性时间算法来计算树中顶点的steiner $ k $ centricity。另一方面，基于一种新颖的技术，建立了一棵树上的平均施泰纳$ k $ centricity指数的下层和上限，这与上一篇论文完全不同，但更容易遵循。
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.
