On different ``middle parts'' of a tree (Q1658760)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6918049
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On different ``middle parts'' of a tree |
scientific article; zbMATH DE number 6918049 |
Statements
On different ``middle parts'' of a tree (English)
0 references
15 August 2018
0 references
Summary: 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.
0 references
eccentricity
0 references
vertex distance
0 references
subtree core
0 references
extremal problems
0 references
comet
0 references
greedy tree
0 references
0.86813074
0 references
0.8516095
0 references
0 references
0 references
0.81352335
0 references
0 references
