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.
محفوظ في:
المؤلفون الرئيسيون: | , |
---|---|
التنسيق: | مقال |
اللغة: | 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. |
---|