Title of article
An Application of Catalan Numbers on Cayley Tree of Order 2: Single Polygon Counting
Author/Authors
Pah, C. H. International Islamic University Malaysia - Faculty of Science - Department of Computational and Theoretical Sciences, Malaysia
From page
175
To page
183
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.
Keywords
Cayley tree , phase transition , contour method , Catalan numbers
Journal title
Bulletin of the Malaysian Mathematical Sciences Society
Journal title
Bulletin of the Malaysian Mathematical Sciences Society
Record number
2549752
Link To Document