Different central parts of trees and their pairwise distances

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

11 pages, 2 figures