Refined enumeration of vertices among all rooted ordered $d$-trees

DOI10.4134/BKMS.b180661zbMath1423.05016arXiv1806.06417MaRDI QIDQ5242387

Heesung Shin, Sang-Wook Kim, Seung-Hyun Seo

Publication date: 8 November 2019

Full work available at URL: https://arxiv.org/abs/1806.06417

zbMATH Keywords

degreebijectionlattice pathlevelrooted ordered \(d\)-tree

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Related Items (1)

Two bijections on weakly increasing trees

Cites Work

• Enumeration of \(K\)-trees and applications
• Enumeration of \(m\)-ary cacti
• Enumerations of vertices among all rooted ordered trees with levels and degrees
• The number of labeled k-dimensional trees
• On the Number of Husimi Trees

This page was built for publication: Refined enumeration of vertices among all rooted ordered $d$-trees