Counting paths in perfect trees
Combinatorics
2017-11-27 v1 Discrete Mathematics
Abstract
We present some exact expressions for the number of paths of a given length in a perfect -ary tree. We first count the paths in perfect rooted -ary trees and then use the results to determine the number of paths in perfect unrooted -ary trees, extending a known result for binary trees.
Keywords
Cite
@article{arxiv.1711.08555,
title = {Counting paths in perfect trees},
author = {Peter J. Humphries},
journal= {arXiv preprint arXiv:1711.08555},
year = {2017}
}
Comments
9 pages