Single polygon counting on Cayley tree of order 4 : generalized Catalan numbers

Single polygon counting on Cayley tree of order 4 : generalized Catalan numbers

We showed that one form of generalized Catalan numbers is the solution to the problem of finding different single component containing single fixed root for Cayley tree of order 4. The upper and lower bounds are given for semi-infinite Cayley tree of order 4.

Bibliographic Details
Main Authors: Pah, Chin Hee, Saburov, Mansoor
Format: Article
Language:English
Published: IDOSI Publications 2013
Subjects:
QA Mathematics
Online Access:http://irep.iium.edu.my/30008/
http://irep.iium.edu.my/30008/
http://irep.iium.edu.my/30008/
http://irep.iium.edu.my/30008/1/MEJSR-Polygon_Counting.pdf
id iium-30008
recordtype eprints
spelling iium-300082013-06-05T09:24:53Z http://irep.iium.edu.my/30008/ Single polygon counting on Cayley tree of order 4 : generalized Catalan numbers Pah, Chin Hee Saburov, Mansoor QA Mathematics We showed that one form of generalized Catalan numbers is the solution to the problem of finding different single component containing single fixed root for Cayley tree of order 4. The upper and lower bounds are given for semi-infinite Cayley tree of order 4. IDOSI Publications 2013-04-22 Article PeerReviewed application/pdf en http://irep.iium.edu.my/30008/1/MEJSR-Polygon_Counting.pdf Pah, Chin Hee and Saburov, Mansoor (2013) Single polygon counting on Cayley tree of order 4 : generalized Catalan numbers. Middle-East Journal of Scientific Research, 13. pp. 1-5. ISSN 1990-9233 http://www.idosi.org/mejsr/mejsr13(mae)13/1.pdf 10.5829/idosi.mejsr.2013.13.mae.9991
repository_type Digital Repository
institution_category Local University
institution International Islamic University Malaysia
building IIUM Repository
collection Online Access
language English
topic QA Mathematics
spellingShingle QA Mathematics
Pah, Chin Hee
Saburov, Mansoor
Single polygon counting on Cayley tree of order 4 : generalized Catalan numbers
description We showed that one form of generalized Catalan numbers is the solution to the problem of finding different single component containing single fixed root for Cayley tree of order 4. The upper and lower bounds are given for semi-infinite Cayley tree of order 4.
format Article
author Pah, Chin Hee
Saburov, Mansoor
author_facet Pah, Chin Hee
Saburov, Mansoor
author_sort Pah, Chin Hee
title Single polygon counting on Cayley tree of order 4 : generalized Catalan numbers
title_short Single polygon counting on Cayley tree of order 4 : generalized Catalan numbers
title_full Single polygon counting on Cayley tree of order 4 : generalized Catalan numbers
title_fullStr Single polygon counting on Cayley tree of order 4 : generalized Catalan numbers
title_full_unstemmed Single polygon counting on Cayley tree of order 4 : generalized Catalan numbers
title_sort single polygon counting on cayley tree of order 4 : generalized catalan numbers
publisher IDOSI Publications
publishDate 2013
url http://irep.iium.edu.my/30008/
http://irep.iium.edu.my/30008/
http://irep.iium.edu.my/30008/
http://irep.iium.edu.my/30008/1/MEJSR-Polygon_Counting.pdf
first_indexed 2023-09-18T20:44:03Z
last_indexed 2023-09-18T20:44:03Z
_version_ 1777409556259799040

Similar Items