Single Polygon Counting on Cayley Tree of Order 3
We showed that one form of generalized Catalan numbers is the solution to the problem of finding different connected component with finite vertices containing a fixed root for the semi-infinite Cayley tree of order 3. We give the formula for the full graph, Cayley tree of order 3 which is derived fr...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Article |
| 語言: | English |
| 出版: |
Springer
2010
|
| 主題: | |
| 在線閱讀: | http://irep.iium.edu.my/293/1/Single_polygon_counting_on_cayley_tree_of_order_3_%281%29.pdf http://irep.iium.edu.my/293/ http://dx.doi.org/10.1007/s10955-010-9989-5 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | We showed that one form of generalized Catalan numbers is the solution to the problem of finding different connected component with finite vertices containing a fixed root for the semi-infinite Cayley tree of order 3. We give the formula for the full graph, Cayley tree of order 3 which is derived from the generalized Catalan numbers. Using ratios of Gamma functions, two upper bounds are given for problem defined on semi-infinite Cayley tree of order 3 as well as the full graph. |
|---|