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

• Main Authors: Mukhamedov, Farrukh, Pah, Chin Hee, Saburov, Mansoor
• 格式: Conference or Workshop Item
• 語言: English
• 出版: American Institute of Physics 2013
• 主題: QA Mathematics
• 在線閱讀: http://irep.iium.edu.my/32234/1/Catalan_Numbers-AIP.pdf; http://irep.iium.edu.my/32234/; http://proceedings.aip.org/

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.