Skip to main content
Log in

Weakly Protected Points in Ordered Trees

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Bender, E.: Asymptotic methods in enumeration. SIAM Rev. 16, 485–515 (1974)

    Article  MathSciNet  Google Scholar 

  2. Cheon, G.-S., Shapiro, L.W.: Protected points in ordered trees. Appl. Math. Lett. 21, 516–520 (2008)

    Article  MathSciNet  Google Scholar 

  3. Cheon, G.-S., Shapiro, L.W.: The uplift principle for ordered trees. Appl. Math. Lett. 21, 1010–1015 (2012)

    Article  MathSciNet  Google Scholar 

  4. Comtet, L.: Advanced Combinatorics. D. Reidel Publishing Company, Boston (1974)

    Book  Google Scholar 

  5. Copenhaver, K.: k-protected vertices in unlabeled rooted plane trees. Graphs Combin. 33, 347–355 (2017)

    Article  MathSciNet  Google Scholar 

  6. Deutsch, E., Shapiro, L.W.: A bijection between ordered trees and \(2\)-Motzkin paths and its many consequences. Discrete Math. 256, 655–670 (2002)

    Article  MathSciNet  Google Scholar 

  7. Deutsch, E.: Ordered trees with prescribed root degrees, node degrees, and branch lengths. Discrete Math. 282, 89–94 (2004)

    Article  MathSciNet  Google Scholar 

  8. Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press, Cambridge (2009)

    Book  Google Scholar 

  9. Merlini, D., Sprugnoli, R., Verri, M.C.: Lagrange inversion: when and how. Acta Appl. Math. 94, 233–249 (2006)

    Article  MathSciNet  Google Scholar 

  10. Merlini, D., Sprugnoli, R., Verri, M.C.: Some statistics on Dyck paths. J. Stat. Plann. Inference 101, 211–227 (2002)

    Article  MathSciNet  Google Scholar 

  11. Sloane, N.J.A.: The On-line Encyclopedia of Integer Sequences. Published electronically at http://oeis.org (2020)

  12. Stanley, R.P.: Enumerative Combinatorics, vol. 2. Cambridge University Press, Cambridge (1999)

    Book  Google Scholar 

Download references

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

Authors

Corresponding author

Correspondence to Sheng-Liang Yang.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-021-02278-w

Keywords

Mathematics Subject Classification

Navigation