• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

H.: An application of Catalan number on Cayley tree of order 2: Single polygon counting (2008)

by C Pah
Add To MetaCart

Tools

Sorted by:
Results 1 - 1 of 1

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

by Farrukh Mukhamedov, Chin Hee, Pah Mansoor Saburov , 2011
"... ar ..."
Abstract - Add to MetaCart
Abstract not found
(Show Context)

Citation Context

...components also describe the topology of a random network. So, we see this research not merely as a mathematical exercise but it does provide some applications in network theory as well. Note that in =-=[15]-=-, the posted problem was solved for the case m = 1, namely, it was shown that the number of different connected component containing a fixed root x0 ∈ V in a semi-infinite Cayley tree for a given n nu...

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University