Research Output | Dar Al-hikmah Library | IIUM Only
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.On connected sub-tree of Cayley tree of order 2 with fixed nodes F. Mukhamedov, C. H. P