ABSTRACT

We determine the tree which maximizes the distance between characteristic set and subtree core over all trees on n vertices. The asymptotic nature of this distance is also discussed. The problem of extremizing the distance between different central parts of trees on n vertices with fixed diameter is studied.

中文翻译：

---

树木的不同中心部分及其成对距离

摘要

我们确定在n个顶点上的所有树上最大化特征集和子树核心之间距离的树。还讨论了该距离的渐近性质。研究了在直径固定的n个顶点上将树木的不同中心部分之间的距离最大化的问题。