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...

Full description

Saved in:
Bibliographic Details
Main Author: Pah, Chin Hee
Format: Article
Language:English
Published: School of Mathematical Sciences, Universiti Sains Malaysia 2008
Subjects:
Online Access: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
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.iium.irep.297
record_format dspace
spelling my.iium.irep.2972013-08-27T01:09:57Z http://irep.iium.edu.my/297/ An application of Catalan Numbers on Cayley tree of order 2: Single Polygon Counting Pah, Chin Hee Q Science (General) QA Mathematics 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 complete graph. Then, we gave a suitable estimate for the given problem. School of Mathematical Sciences, Universiti Sains Malaysia 2008 Article REM application/pdf en http://irep.iium.edu.my/297/1/v31n2p7.pdf Pah, Chin Hee (2008) An application of Catalan Numbers 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/pdf/v31n2/v31n2p7.pdf
institution Universiti Islam Antarabangsa Malaysia
building IIUM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider International Islamic University Malaysia
content_source IIUM Repository (IREP)
url_provider http://irep.iium.edu.my/
language English
topic Q Science (General)
QA Mathematics
spellingShingle Q Science (General)
QA Mathematics
Pah, Chin Hee
An application of Catalan Numbers on Cayley tree of order 2: Single Polygon Counting
description 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 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 An application of Catalan Numbers on Cayley tree of order 2: Single Polygon Counting
title_short An application of Catalan Numbers on Cayley tree of order 2: Single Polygon Counting
title_full An application of Catalan Numbers on Cayley tree of order 2: Single Polygon Counting
title_fullStr An application of Catalan Numbers on Cayley tree of order 2: Single Polygon Counting
title_full_unstemmed An application of Catalan Numbers on Cayley tree of order 2: Single Polygon Counting
title_sort application of catalan numbers 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/297/1/v31n2p7.pdf
http://irep.iium.edu.my/297/
http://www.emis.de/journals/BMMSS/pdf/v31n2/v31n2p7.pdf
_version_ 1643604592948150272
score 13.144533