hrcak mascot   Srce   HID

Izvorni znanstveni članak

Morgan Trees and Dyck Paths

Tomislav Došlić   ORCID icon orcid.org/0000-0002-8326-513X ; 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: 457* citiraj
APA 6th Edition
Došlić, T. (2002). Morgan Trees and Dyck Paths. Croatica Chemica Acta, 75 (4), 881-889. Preuzeto s https://hrcak.srce.hr/131742
MLA 8th Edition
Došlić, Tomislav. "Morgan Trees and Dyck Paths." Croatica Chemica Acta, vol. 75, br. 4, 2002, str. 881-889. https://hrcak.srce.hr/131742. Citirano 01.03.2021.
Chicago 17th Edition
Došlić, Tomislav. "Morgan Trees and Dyck Paths." Croatica Chemica Acta 75, br. 4 (2002): 881-889. https://hrcak.srce.hr/131742
Harvard
Došlić, T. (2002). 'Morgan Trees and Dyck Paths', Croatica Chemica Acta, 75(4), str. 881-889. Preuzeto s: https://hrcak.srce.hr/131742 (Datum pristupa: 01.03.2021.)
Vancouver
Došlić T. Morgan Trees and Dyck Paths. Croatica Chemica Acta [Internet]. 2002 [pristupljeno 01.03.2021.];75(4):881-889. Dostupno na: https://hrcak.srce.hr/131742
IEEE
T. Došlić, "Morgan Trees and Dyck Paths", Croatica Chemica Acta, vol.75, br. 4, str. 881-889, 2002. [Online]. Dostupno na: https://hrcak.srce.hr/131742. [Citirano: 01.03.2021.]

Sažetak
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: 131742

URI
https://hrcak.srce.hr/131742

Posjeta: 568 *