\(k\)-protected vertices in unlabeled rooted plane trees
From MaRDI portal
Publication:2014218
DOI10.1007/s00373-017-1772-9zbMath1368.05008arXiv1606.00083OpenAlexW2964027155MaRDI QIDQ2014218
Publication date: 10 August 2017
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.00083
Trees (05C05) Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16)
Related Items
Protected Branches in Ordered Trees, Protection number in plane trees, On the peel number and the leaf-height of Galton–Watson trees, Protected cells in compositions, Weakly protected points in ordered trees, Limiting probabilities for vertices of a given rank in 1-2 trees, Nonleaf Patterns in Trees: Protected Nodes and Fine Numbers
Cites Work
- Unnamed Item
- \(k\)-protected vertices in binary search trees
- Notes on protected nodes in digital search trees
- Protected points in \(k\)-ary trees
- Protected nodes and fringe subtrees in some random trees
- Protected points in ordered trees
- Isomorphism and Symmetries in Random Phylogenetic Trees
- On a random search tree: asymptotic enumeration of vertices by distance from leaves
- Asymptotic Properties of Protected Nodes in Random Recursive Trees