Single Polygon Counting on Cayley Tree of Order 3
We showed that one form of generalized Catalan numbers is the solution to the problem of finding different connected component with finite vertices containing a fixed root for the semi-infinite Cayley tree of order 3. We give the formula for the full graph, Cayley tree of order 3 which is derived fr...
Saved in:
Main Author: | Pah, Chin Hee |
---|---|
Format: | Article |
Language: | English |
Published: |
Springer
2010
|
Subjects: | |
Online Access: | http://irep.iium.edu.my/293/1/Single_polygon_counting_on_cayley_tree_of_order_3_%281%29.pdf http://irep.iium.edu.my/293/ http://dx.doi.org/10.1007/s10955-010-9989-5 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
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) -
An application of Catalan Numbers on Cayley tree of order 2: Single Polygon Counting
by: Pah, Chin Hee
Published: (2008) -
Single polygon counting for two fixed nodes on a Cayley tree of order 2
by: Pah, Chin Hee
Published: (2011) -
Exact solution for an Ising model on the Cayley tree of order
by: Jamil, Hakim, et al.
Published: (2016)