DOI: https://doi.org/10.11568/kjm.2012.20.2.
A REFINEMENT FOR ORDERED LABELED TREES
Abstract
Let O_n be the set of ordered labeled trees on {0, . . . , n}. A maximal decreasing subtree of an ordered labeled tree is defined by the maximal ordered subtree from the root with all edges being decreasing. In this paper, we study a new refinement O_{n,k} of O_n, which is the set of ordered labeled trees whose maximal decreasing subtree has k + 1 vertices.
Subject classification
Sponsor(s)
Full Text:
PDFRefbacks
- There are currently no refbacks.
ISSN: 1976-8605 (Print), 2288-1433 (Online)
Copyright(c) 2013 By The Kangwon-Kyungki Mathematical Society, Department of Mathematics, Kangwon National University Chuncheon 21341, Korea Fax: +82-33-259-5662 E-mail: kkms@kangwon.ac.kr