Note on the number of rooted complete N-ary trees.

MaRDI QIDQ3094565zbMATH OpenFDO

Authors Stephan Dominique Andres

Publication date 25 October 2011

zbMATH Keywords

\(N\)-ary operationadder topologycomplete \(N\)-ary rooted treeparenthesis structure enumeration

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Recommendations

• scientific article; zbMATH DE number 4025461
• Number of complete \(N\)-ary subtrees on Galton-Watson family trees
• A recursive algorithm for trees and forests
• Counting ternary trees according to the number of middle edges and factorizing into (3/2)-ary trees
• scientific article; zbMATH DE number 4134081

Cited in

(2)

• A link between ordered trees and green-red trees
• scientific article; zbMATH DE number 6385357 (Why is no real title available?)

This page was built for publication: Note on the number of rooted complete \(N\)-ary trees.

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