On connected sub-tree with fixed nodes in Cayley tree of Order 2
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...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English English |
| Published: |
Southeast Asian Mathematical Society
2017
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/58086/ http://irep.iium.edu.my/58086/ 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 |
| Summary: | 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 triangles. |
|---|