arXiv Analytics

Sign in

arXiv:1606.00083 [math.CO]AbstractReferencesReviewsResources

$k$-protected vertices in unlabeled rooted plane trees

Keith Copenhaver

Published 2016-06-01Version 1

We find a simple, closed formula for the proportion of vertices which are $k$-protected in all unlabeled rooted plane trees on $n$ vertices. We also find that, as $n$ goes to infinity, the average rank of a random vertex in a tree of size $n$ approaches 0.727649, and the average rank of the root of a tree of size $n$ approaches 1.62297.

Related articles: Most relevant | Search more
arXiv:1304.6105 [math.CO] (Published 2013-04-22)
$k$-protected vertices in binary search trees
arXiv:math/0104111 [math.CO] (Published 2001-04-10)
Walks on the slit plane: other approaches
arXiv:2108.04989 [math.CO] (Published 2021-08-11)
Random increasing plane trees: asymptotic enumeration of vertices by distance from leaves