Multi-edge trees as introduced in a recent paper of Dziemiańczuk are plane trees where multiple edges are allowed. We first show that d-ary multi-edge trees where the out-degrees are bounded by d are in bijection with classical d-ary trees. This allows us to analyse parameters such as the height. The main part of this paper is concerned with multi-edge trees counted by their number of edges. The distribution of the number of vertices as well as the height are analysed asymptotically.
CITATION STYLE
Heuberger, C., Prodinger, H., & Wagner, S. (2016). The height of multiple edge plane trees. Aequationes Mathematicae, 90(3), 625–645. https://doi.org/10.1007/s00010-015-0380-0
Mendeley helps you to discover research relevant for your work.