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...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | مقال |
| اللغة: | 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 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|