Counting paths in perfect trees
classification
🧮 math.CO
cs.DM
keywords
pathsperfecttreesnumberbinarycountcountingdetermine
read the original abstract
We present some exact expressions for the number of paths of a given length in a perfect $m$-ary tree. We first count the paths in perfect rooted $m$-ary trees and then use the results to determine the number of paths in perfect unrooted $m$-ary trees, extending a known result for binary trees.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.