On connected sub-tree of Cayley tree of order 2 with fixed nodes

We found an exact formulation for a finite sub-tree counting problem. Solution to two extremal cases are Catalan Triangle introduced by Shapiro and ballot Catalan triangles. The general solution could be expressed as linear combination of these Catalan triangles.

Bibliographic Details
Main Authors: Mukhamedov, Farrukh, Pah, Chin Hee, Saburov, Mansoor
Format: Conference or Workshop Item
Language:English
Published: American Institute of Physics 2013
Subjects:
Online Access:http://irep.iium.edu.my/32234/
http://irep.iium.edu.my/32234/
http://irep.iium.edu.my/32234/1/Catalan_Numbers-AIP.pdf