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...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Springer
2010
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/293/ http://irep.iium.edu.my/293/ http://irep.iium.edu.my/293/ http://irep.iium.edu.my/293/1/Single_polygon_counting_on_cayley_tree_of_order_3_%281%29.pdf |
| id |
iium-293 |
|---|---|
| recordtype |
eprints |
| spelling |
iium-2932011-07-11T08:02:01Z http://irep.iium.edu.my/293/ Single Polygon Counting on Cayley Tree of Order 3 Pah, Chin Hee QA Mathematics 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. Springer 2010 Article PeerReviewed application/pdf en http://irep.iium.edu.my/293/1/Single_polygon_counting_on_cayley_tree_of_order_3_%281%29.pdf Pah, Chin Hee (2010) Single Polygon Counting on Cayley Tree of Order 3. Journal of Statistical Physics, 140 (1). pp. 198-207. ISSN 0022-4715 http://dx.doi.org/10.1007/s10955-010-9989-5 10.1007/s10955-010-9989-5 |
| repository_type |
Digital Repository |
| institution_category |
Local University |
| institution |
International Islamic University Malaysia |
| building |
IIUM Repository |
| collection |
Online Access |
| language |
English |
| topic |
QA Mathematics |
| spellingShingle |
QA Mathematics Pah, Chin Hee Single Polygon Counting on Cayley Tree of Order 3 |
| description |
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. |
| format |
Article |
| author |
Pah, Chin Hee |
| author_facet |
Pah, Chin Hee |
| author_sort |
Pah, Chin Hee |
| title |
Single Polygon Counting on Cayley Tree of Order 3 |
| title_short |
Single Polygon Counting on Cayley Tree of Order 3 |
| title_full |
Single Polygon Counting on Cayley Tree of Order 3 |
| title_fullStr |
Single Polygon Counting on Cayley Tree of Order 3 |
| title_full_unstemmed |
Single Polygon Counting on Cayley Tree of Order 3 |
| title_sort |
single polygon counting on cayley tree of order 3 |
| publisher |
Springer |
| publishDate |
2010 |
| url |
http://irep.iium.edu.my/293/ http://irep.iium.edu.my/293/ http://irep.iium.edu.my/293/ http://irep.iium.edu.my/293/1/Single_polygon_counting_on_cayley_tree_of_order_3_%281%29.pdf |
| first_indexed |
2023-09-18T20:07:25Z |
| last_indexed |
2023-09-18T20:07:25Z |
| _version_ |
1777407251500236800 |