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

Full description

Saved in:
Bibliographic Details
Main Author: Pah, Chin Hee
Format: Article
Published: School of Mathematical Sciences, Universiti Sains Malaysia 2008
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!