Single Polygon Counting for $m$ Fixed Nodes in Cayley Tree: Two Extremal Cases

Details Single Polygon Counting for $m$ Fixed Nodes in Cayley Tree: Two Extremal Cases Single Polygon Counting for $m$ Fixed Nodes in Cayley Tree: Two Extremal Cases

2010-04-14

arxiv.org/abs/1004.2305v1

Mathematics

Number Theory

18 pages, 5 figures

Scientific paper

We denote a polygon as a connected component in Cayley tree of order 2 containing certain number of fix vertices. We found an exact formula for a polygon counting problem for two cases, in which, for the first case the polygon contain a full connected component of a Cayley tree and for the second case the polygon contain two fixed vertices. From these formulas, which is in the form of finite linear combination of Catalan numbers, one can find the asymptotic estimation for a counting problem.

Affiliated with

Also associated with

No associations

Rating

Single Polygon Counting for $m$ Fixed Nodes in Cayley Tree: Two Extremal Cases does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Single Polygon Counting for $m$ Fixed Nodes in Cayley Tree: Two Extremal Cases, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Single Polygon Counting for $m$ Fixed Nodes in Cayley Tree: Two Extremal Cases will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-524920