Application of Catalan Number on Cayley tree: of order 2: single Polygon Counting
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 complete graph.Th...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
School of Mathematical Sciences, Universiti Sains Malaysia
2008
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/294/ http://irep.iium.edu.my/294/ http://irep.iium.edu.my/294/1/An_Application_of_Catalan_Numbers_on_Cayley_%281%29.pdf |
| id |
iium-294 |
|---|---|
| recordtype |
eprints |
| spelling |
iium-2942011-06-09T01:36:20Z http://irep.iium.edu.my/294/ Application of Catalan Number on Cayley tree: of order 2: single Polygon Counting Pah, Chin Hee QA Mathematics 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 complete graph.Then, we gave a suitable estimate for the given problem. School of Mathematical Sciences, Universiti Sains Malaysia 2008 Article PeerReviewed application/pdf en http://irep.iium.edu.my/294/1/An_Application_of_Catalan_Numbers_on_Cayley_%281%29.pdf Pah, Chin Hee (2008) Application of Catalan Number on Cayley tree: of order 2: single Polygon Counting. Bulletin of the Malaysian Mathematical Sciences Society, 31 (2). pp. 175-183. ISSN 0126-6705 http://www.emis.de/journals/BMMSS/vol31_2_7.htm |
| 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 Application of Catalan Number on Cayley tree: of order 2: single Polygon Counting |
| description |
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 complete graph.Then, we gave a suitable estimate for the given problem. |
| format |
Article |
| author |
Pah, Chin Hee |
| author_facet |
Pah, Chin Hee |
| author_sort |
Pah, Chin Hee |
| title |
Application of Catalan Number on Cayley tree: of order 2: single Polygon Counting |
| title_short |
Application of Catalan Number on Cayley tree: of order 2: single Polygon Counting |
| title_full |
Application of Catalan Number on Cayley tree: of order 2: single Polygon Counting |
| title_fullStr |
Application of Catalan Number on Cayley tree: of order 2: single Polygon Counting |
| title_full_unstemmed |
Application of Catalan Number on Cayley tree: of order 2: single Polygon Counting |
| title_sort |
application of catalan number on cayley tree: of order 2: single polygon counting |
| publisher |
School of Mathematical Sciences, Universiti Sains Malaysia |
| publishDate |
2008 |
| url |
http://irep.iium.edu.my/294/ http://irep.iium.edu.my/294/ http://irep.iium.edu.my/294/1/An_Application_of_Catalan_Numbers_on_Cayley_%281%29.pdf |
| first_indexed |
2023-09-18T20:07:25Z |
| last_indexed |
2023-09-18T20:07:25Z |
| _version_ |
1777407251647037440 |