Sciweavers

CPC
2004
76views more  CPC 2004»
13 years 11 months ago
On Some Parameters in Heap Ordered Trees
Heap ordered trees are planted plane trees, labelled in such a way that the labels always increase from the root to a leaf. We study two parameters, assuming that p of the n nodes ...
Kate Morris, Alois Panholzer, Helmut Prodinger
RSA
2006
51views more  RSA 2006»
13 years 11 months ago
Limit laws for embedded trees: Applications to the integrated superBrownian excursion
We study three families of labelled plane trees. In all these trees, the root is
Mireille Bousquet-Mélou
EJC
2006
13 years 11 months ago
Parity reversing involutions on plane trees and 2-Motzkin paths
The problem of counting plane trees with n edges and an even or an odd number of leaves has been recently studied by Eu, Liu and Yeh, in connection with an identity on coloring ne...
William Y. C. Chen, Louis W. Shapiro, Laura L. M. ...
EJC
2006
13 years 11 months ago
Old and young leaves on plane trees
Abstract. A leaf of a plane tree is called an old leaf if it is the leftmost child of its parent, and it is called a young leaf otherwise. In this paper we enumerate plane trees wi...
William Y. C. Chen, Emeric Deutsch, Sergi Elizalde
EJC
2010
13 years 11 months ago
Bijections for a class of labeled plane trees
We consider plane trees whose vertices are given labels from the set {1, 2, . . . , k} in such a way that the sum of the labels along any edge is at most k + 1; it turns out that ...
Nancy S. S. Gu, Helmut Prodinger, Stephan Wagner