Some results for monotonically labelled simply generated trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

Some results for monotonically labelled simply generated trees


We consider simply generated trees, where the nodes are equipped with weakly monotone labellings with elements of $\{1, 2, \ldots, r\}$, for $r$ fixed. These tree families were introduced in Prodinger and Urbanek (1983) and studied further in Kirschenhofer (1984), Blieberger (1987), and Morris and Prodinger (2005). Here we give distributional results for several tree statistics (the depth of a random node, the ancestor-tree size and the Steiner-distance of $p$ randomly chosen nodes, the height of the $j$-st leaf, and the number of nodes with label $l$), which extend the existing results and also contain the corresponding results for unlabelled simply generated trees as the special case $r=1$.
Fichier principal
Vignette du fichier
dmAD0117.pdf (144.85 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01184028 , version 1 (12-08-2015)



Bernhard Gittenberger, Alois Panholzer. Some results for monotonically labelled simply generated trees. 2005 International Conference on Analysis of Algorithms, 2005, Barcelona, Spain. pp.173-180, ⟨10.46298/dmtcs.3356⟩. ⟨hal-01184028⟩


56 View
745 Download



Gmail Facebook X LinkedIn More