Restricted Walks in Regular Trees

Let T be the Cayley graph of a finitely generated free group F. Given two vertices in T consider all the walks of a given length between these vertices that at a certain time must follow a number of predetermined steps. We give formulas for the number of such walks by expressing the problem in terms of equations in F and solving the corresponding equations.

• Type: Journal
• Year: 2006
• Where: COMBINATORICS
• Authors: Laura Ciobanu, Sasa Radomirovic
• Keywords: Cayley Graph, Certain Time, COMBINATORICS 2006, Free Group F