Geodesic
On the centroid of increasing trees
Discrete mathematics & theoretical computer science, Tome 21 (2019) no. 4 Cet article a éte moissonné depuis la source Episciences

Voir la notice de l'article

A centroid node in a tree is a node for which the sum of the distances to all other nodes attains its minimum, or equivalently a node with the property that none of its branches contains more than half of the other nodes. We generalise some known results regarding the behaviour of centroid nodes in random recursive trees (due to Moon) to the class of very simple increasing trees, which also includes the families of plane-oriented and $d$-ary increasing trees. In particular, we derive limits of distributions and moments for the depth and label of the centroid node nearest to the root, as well as for the size of the subtree rooted at this node. 
@article{DMTCS_2019_21_4_a8,
     author = {Durant, Kevin and Wagner, Stephan},
     title = {On the centroid of increasing trees},
     journal = {Discrete mathematics & theoretical computer science},
     year = {2019},
     volume = {21},
     number = {4},
     doi = {10.23638/DMTCS-21-4-8},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-21-4-8/}
}
TY  - JOUR
AU  - Durant, Kevin
AU  - Wagner, Stephan
TI  - On the centroid of increasing trees
JO  - Discrete mathematics & theoretical computer science
PY  - 2019
VL  - 21
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-21-4-8/
DO  - 10.23638/DMTCS-21-4-8
LA  - en
ID  - DMTCS_2019_21_4_a8
ER  - 
%0 Journal Article
%A Durant, Kevin
%A Wagner, Stephan
%T On the centroid of increasing trees
%J Discrete mathematics & theoretical computer science
%D 2019
%V 21
%N 4
%U http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-21-4-8/
%R 10.23638/DMTCS-21-4-8
%G en
%F DMTCS_2019_21_4_a8
Durant, Kevin; Wagner, Stephan. On the centroid of increasing trees. Discrete mathematics & theoretical computer science, Tome 21 (2019) no. 4. doi: 10.23638/DMTCS-21-4-8

Cité par Sources :