Counting paths in perfect trees
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.