| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651017 | Discrete Mathematics | 2006 | 10 Pages |
Abstract
In this paper ordered trees are studied with respect to the inorder traversal. New decompositions of ordered trees are introduced and used to obtain enumeration results according to various parameters. Furthermore, the set of all ordered trees with prescribed degree sequence according to the inorder is studied with the aid of Dyck paths. This set is constructed and its cardinal number is evaluated recursively.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
A. Sapounakis, I. Tasoulas, P. Tsikouras,