Counting vertices with given outdegree in plane trees and \(k\)-ary trees

DOI10.1007/s00373-018-1975-8zbMath1407.05012OpenAlexW2901902061MaRDI QIDQ1733869

Rosena R. X. Du, Xueli Yun, Jia He

Publication date: 21 March 2019

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-018-1975-8

zbMATH Keywords

degreecomposition\(k\)-ary treesplane treesbijective proofoutdegree

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Vertex degrees (05C07)

Related Items (2)

Counting vertices with given outdegree in plane trees and \(k\)-ary trees ⋮ Two bijections on weakly increasing trees

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Counting vertices with given outdegree in plane trees and \(k\)-ary trees
• Odd or even on plane trees
• Enumerations of vertices among all rooted ordered trees with levels and degrees
• Functional Composition Patterns and Power Series Reversion
• A survey of the Fine numbers

This page was built for publication: Counting vertices with given outdegree in plane trees and \(k\)-ary trees