Counting closed walks in infinite regular trees using Catalan and Borel's triangles
Combinatorics
2022-12-20 v1
Abstract
We count the number of closed walks on a vertex in a regular tree using the Catalan's triangle and also the Borel's triangle, showing another combinatorial structure counted by these two array of numbers.
Keywords
Cite
@article{arxiv.2212.08795,
title = {Counting closed walks in infinite regular trees using Catalan and Borel's triangles},
author = {Lord C. Kavi and Michael W. Newman},
journal= {arXiv preprint arXiv:2212.08795},
year = {2022}
}