On connected sub-tree with fixed nodes in Cayley tree of Order 2

• المؤلفون الرئيسيون: Mukhamedov, Farrukh, Pah, Chin Hee, Saburov, Mansoor
• التنسيق: مقال
• اللغة: English; English
• منشور في: Southeast Asian Mathematical Society 2017
• الموضوعات: QA Mathematics
• الوصول للمادة أونلاين: http://irep.iium.edu.my/58086/1/09_41%283%29.pdf; http://irep.iium.edu.my/58086/7/58086_On%20connected%20sub-tree%20with%20fixed%20nodes_wos.pdf; http://irep.iium.edu.my/58086/; http://www.seams-bull-math.ynu.edu.cn/quick_search_result.jsp

In this paper we found an exact formula for a finite sub-tree counting problem. Note that the formulas, which correspond to two extremal cases, are Catalan Triangle introduced by Shapiro and ballot Catalan triangles. The general formula could be expressed as a linear combination of these Catalan tri...