A point in a weighted tree that has minimum weight for the tree. The set of all centroid points is called a tree
centroid (Harary 1994, p. 36). The largest possible values for a centroid
point (i.e., the maximum minimum weight) for a tree on , 3, ... nodes are 1, 1, 2, 2, 3, 3, ....
, 3, ... nodes are 1, 1, 2, 2, 3, 3, ....
