Cover Image

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.

Saved in:
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/1/MEJSR-Polygon_Counting.pdf
http://irep.iium.edu.my/30008/
http://www.idosi.org/mejsr/mejsr13(mae)13/1.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.iium.irep.30008
record_format dspace
spelling my.iium.irep.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 REM 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
institution Universiti Islam Antarabangsa Malaysia
building IIUM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider International Islamic University Malaysia
content_source IIUM Repository (IREP)
url_provider http://irep.iium.edu.my/
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/1/MEJSR-Polygon_Counting.pdf
http://irep.iium.edu.my/30008/
http://www.idosi.org/mejsr/mejsr13(mae)13/1.pdf
_version_ 1643609799187759104
score 13.149126

Similar Items