Counting paths in perfect trees

11/23/2017
by   Peter J. Humphries, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset
Success!
Error Icon An error occurred

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×

Consider DeepAI Pro