Counting mutations and anti-chains in complete binary trees

MaRDI QIDQ3110070zbMATH OpenFDO

Authors Lifoma Salaam, Louis W. Shapiro

Publication date 26 January 2012

zbMATH Keywords

Catalan numbersleaf generating functionsMotzkin numbersMotzkin treesrooted trees

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Trees (05C05) Enumeration in graph theory (05C30)

Recommendations

• Counting chains and antichains in the complete binary tree.
• Monotonically labelled Motzkin trees
• Profiles of ordered trees with mutation and associated Riordan matrices
• Twelve countings with rooted plane trees
• Boundary of complete binary trees

Cited in

(1)

• Profiles of ordered trees with mutation and associated Riordan matrices

This page was built for publication: Counting mutations and anti-chains in complete binary trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3110070)