





















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
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。