A refined enumeration of p-ary labeled trees

Title
A refined enumeration of p-ary labeled trees
Authors
신희성
Keywords
p-ary labeled tree, Re nement, Maximal decreasing subtree
Issue Date
2013
Publisher
한국수학논문집
Series/Report no.
한국수학논문집; 제21권 제4호 pp 495~502
Abstract
Let T (p)n be the set of p-ary labeled trees on{1,2,...,n}. A maximal decreasing subtree of an p-ary labeled tree is de ned by the maximal p-ary subtree from the root with all edges being decreasing. In this paper, we study a new re nement T (p)n,k of T (p)n , which is the set of p-ary labeled trees whose maximal decreasing subtree has k vertices.
URI
http://dx.doi.org/10.11568/kjm.2013.21.4.495
http://dspace.inha.ac.kr/handle/10505/33953
ISSN
1976-8605
Appears in Collections:
College of Natural Science(자연과학대학) > Mathematics (수학) > Local Access Journal Papers, Reports(수학 논문, 보고서)

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse