Abstract
In this paper, we enumerate the set of ordered trees with n edges according to the number of weakly protected points. Explicit formulas as well as generating functions are obtained. We also find that, as n goes to infinity, the proportion of weakly protected points among all vertices of ordered trees with n edges approaches 1/3.
Similar content being viewed by others
References
Bender, E.: Asymptotic methods in enumeration. SIAM Rev. 16, 485–515 (1974)
Cheon, G.-S., Shapiro, L.W.: Protected points in ordered trees. Appl. Math. Lett. 21, 516–520 (2008)
Cheon, G.-S., Shapiro, L.W.: The uplift principle for ordered trees. Appl. Math. Lett. 21, 1010–1015 (2012)
Comtet, L.: Advanced Combinatorics. D. Reidel Publishing Company, Boston (1974)
Copenhaver, K.: k-protected vertices in unlabeled rooted plane trees. Graphs Combin. 33, 347–355 (2017)
Deutsch, E., Shapiro, L.W.: A bijection between ordered trees and \(2\)-Motzkin paths and its many consequences. Discrete Math. 256, 655–670 (2002)
Deutsch, E.: Ordered trees with prescribed root degrees, node degrees, and branch lengths. Discrete Math. 282, 89–94 (2004)
Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press, Cambridge (2009)
Merlini, D., Sprugnoli, R., Verri, M.C.: Lagrange inversion: when and how. Acta Appl. Math. 94, 233–249 (2006)
Merlini, D., Sprugnoli, R., Verri, M.C.: Some statistics on Dyck paths. J. Stat. Plann. Inference 101, 211–227 (2002)
Sloane, N.J.A.: The On-line Encyclopedia of Integer Sequences. Published electronically at http://oeis.org (2020)
Stanley, R.P.: Enumerative Combinatorics, vol. 2. Cambridge University Press, Cambridge (1999)
Acknowledgements
The authors wish to thank the referees and editor for their valuable suggestions which improved the quality of this paper. This work is supported by the National Natural Science Foundation of China (Grant No. 11861045) and the Hongliu Foundation of First-class Disciplines of Lanzhou University of Technology, China.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Yang, L., Yang, SL. Weakly Protected Points in Ordered Trees. Graphs and Combinatorics 37, 775–788 (2021). https://doi.org/10.1007/s00373-021-02278-w
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-021-02278-w
Keywords
- Ordered trees
- Complete binary trees
- Motzkin trees
- Weakly protected points
- Bivariate generating function
- Lagrange inversion formula