Single polygon counting on Cayley tree of order 4 : generalized Catalan numbers
We showed that one form of generalized Catalan numbers is the solution to the problem of finding different single component containing single fixed root for Cayley tree of order 4. The upper and lower bounds are given for semi-infinite Cayley tree of order 4.
Saved in:
| Main Authors: | , |
|---|---|
| 格式: | Article |
| 語言: | English |
| 出版: |
IDOSI Publications
2013
|
| 主題: | |
| 在線閱讀: | http://irep.iium.edu.my/30008/1/MEJSR-Polygon_Counting.pdf http://irep.iium.edu.my/30008/ http://www.idosi.org/mejsr/mejsr13(mae)13/1.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | We showed that one form of generalized Catalan numbers is the solution to the problem of finding different single component containing single fixed root for Cayley tree of order 4. The upper and lower bounds are given for semi-infinite Cayley tree of order 4. |
|---|