An application of Catalan Numbers on Cayley tree of order 2: Single Polygon Counting
Abstract. In this paper, we consider a problem on finding the number of different single connected component containing a fixed root for a given number of vertices on semi-infinite Cayley tree. The solution of this problem is the well known Catalan numbers. The result is then extended to the complet...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Article |
| 語言: | English |
| 出版: |
School of Mathematical Sciences, Universiti Sains Malaysia
2008
|
| 主題: | |
| 在線閱讀: | http://irep.iium.edu.my/297/1/v31n2p7.pdf http://irep.iium.edu.my/297/ http://www.emis.de/journals/BMMSS/pdf/v31n2/v31n2p7.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|