Weakly protected points in ordered trees

DOI10.1007/s00373-021-02278-wzbMath1470.05081OpenAlexW3123865324MaRDI QIDQ2045373

Lin Yang, Sheng-Liang Yang

Publication date: 12 August 2021

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

Full work available at URL: https://doi.org/10.1007/s00373-021-02278-w

zbMATH Keywords

Lagrange inversion formulaMotzkin treesordered treesbivariate generating functioncomplete binary treesweakly protected points

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorics of partially ordered sets (06A07) Enumeration in graph theory (05C30) Asymptotic enumeration (05A16)

Related Items (1)

Weakly protected nodes in random binary search trees

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The uplift principle for ordered trees
• Lagrange inversion: when and how
• Some statistics on Dyck paths
• Ordered trees with prescribed root degrees, node degrees, and branch lengths
• A bijection between ordered trees and 2-Motzkin paths and its many consequences
• \(k\)-protected vertices in unlabeled rooted plane trees
• Protected points in ordered trees
• Asymptotic Methods in Enumeration

This page was built for publication: Weakly protected points in ordered trees