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...
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/ http://irep.iium.edu.my/297/ http://irep.iium.edu.my/297/1/v31n2p7.pdf |
Similar Items
-
Application of Catalan Number on Cayley tree: of order 2: single Polygon Counting
by: Pah, Chin Hee
Published: (2008) -
Single polygon counting on Cayley tree of order 4 : generalized Catalan numbers
by: Pah, Chin Hee, et al.
Published: (2013) -
Single Polygon Counting on Cayley Tree of Order 3
by: Pah, Chin Hee
Published: (2010) -
Single polygon counting for two fixed nodes on a Cayley tree of order 2
by: Pah, Chin Hee
Published: (2011) -
On connected sub-tree of Cayley tree of order 2 with fixed nodes
by: Mukhamedov, Farrukh, et al.
Published: (2013)