On different “middle parts” of a tree

Heather Smith, László Székely, Hua Wang, Shuai Yuan

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

We determine the maximum distance between any two of the center, centroid, and subtree core among trees with a given order. Corresponding results are obtained for trees with given maximum degree and also for trees with given diameter. The problem of the maximum distance between the centroid and the subtree core among trees with given order and diameter becomes difficult. It can be solved in terms of the problem of minimizing the number of root-containing subtrees in a rooted tree of given order and height. While the latter problem remains unsolved, we provide a partial characterization of the extremal structure.

Original languageEnglish
Article number#P3.17
JournalElectronic Journal of Combinatorics
Volume25
Issue number3
DOIs
StatePublished - Jul 27 2018

Keywords

  • Comet
  • Eccentricity
  • Extremal problems
  • Greedy tree
  • Subtree core
  • Vertex distance

Fingerprint

Dive into the research topics of 'On different “middle parts” of a tree'. Together they form a unique fingerprint.

Cite this