Skoči na glavni sadržaj

Izvorni znanstveni članak

Morgan Trees and Dyck Paths

Tomislav Došlić orcid id ; Department of Informatics and Mathematics, Faculty of Agriculture, University of Zagreb, Svetošimunska c. 25, 10000 Zagreb, Croatia

Puni tekst: engleski pdf 81 Kb

str. 881-889

preuzimanja: 595



A simple bijection is established between Morgan trees and Dyck paths. As a consequence, exact enumerative results for Morgan trees on given number of vertices are obtained in terms of Catalan numbers. The results are further refined by enumerating all Morgan trees with prescribed number of internal vertices and by computing the average number of internal vertices in a Morgan tree.

Ključne riječi

Morgan trees, Dyck paths, Catalan numbers, Narayana numbers

Hrčak ID:



Posjeta: 794 *