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...
School of Mathematical Sciences, Universiti Sains Malaysia
No Tags, Be the first to tag this record!