An Application of Catalan Numbers on Cayley Tree of Order 2: Single Polygon Counting

BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY（2008）

引用 22|浏览1

暂无评分

摘要

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 it suitable estimate for the given problem.

查看译文

关键词

Cayley tree,phase transition,contour method,Catalan numbers

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要