Skip to main content
SpringerLink
Log in

Asymptotische Untersuchungen Zur Durchschnittlichen Gestalt Gewisser Graphenklassen

  • Conference paper
  • First Online:
Zahlentheoretische Analysis

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 1114))

Abstract

In this paper we derive an asymptotic result for the average height of the (t−1)j+1-st leaf of an extended t-ary tree with n internal nodes (where all such trees are regarded equally likely and the leaves of each tree are enumerated from left to right) concerning the limiting case j,n→∞, j/n=ρ fixed.

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

Access this chapter

Log in via an institution
eBook
USD 19.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 29.95
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. N.G. deBRUIJN, D.E. KNUTH, S.O. RICE, The average height of planted plane trees, Graph Theory and Computing (R. Read ed.), 15–22, Academic Press, New York 1972.

    Chapter  Google Scholar 

  2. L. COMTET, Advanced Combinatorics, D.Reidel, Dordrecht 1974.

    Book  MATH  Google Scholar 

  3. Ph.FLAJOLET, Analyse d’algorithmes de manipulation d’arbres et de fichiers, Thèse Paris-Sud-Orsay 1979, Cahiers de BURO 34-35 (1981), 1–209.

    Google Scholar 

  4. Ph. FLAJOLET, A. ODLYZKO, The average height of binary trees and other simple trees, J.Comput.System Sci. 25(1981), 171–213.

    Article  MathSciNet  MATH  Google Scholar 

  5. Ph. FLAJOLET, J.M. STEYAERT, On the analysis of tree matching algorithms, in: Springer Lecture Notes in Computer Science 85 (1980), 208–219.

    Article  MathSciNet  MATH  Google Scholar 

  6. I.P. GOULDEN, D.M. JACKSON, Combinatorial enumeration, John Wiley, New York 1983.

    MATH  Google Scholar 

  7. F. HARARY, E.M. PALMER, Graphical enumeration, Academic Press, New York 1973.

    MATH  Google Scholar 

  8. R. KEMP, The average height of r-tuply rooted planted plane trees, Computing 25 (1980), 209–232.

    Article  MathSciNet  MATH  Google Scholar 

  9. R. KEMP, A note on the stack size of regularly distributed binary trees, BIT 20 (1980), 157–163.

    Article  MathSciNet  MATH  Google Scholar 

  10. R. KEMP, On the average oscillation of a stack, Combinatorica 2 (1982), 157–176.

    Article  MathSciNet  MATH  Google Scholar 

  11. P.KIRSCHENHOFER, Asymptotic results on a special kind of order preserving maps, Österr.Akad.Wiss.Math.Nat.Kl.SB.II/191 (1982), 369–380.

    Google Scholar 

  12. P. KIRSCHENHOFER, On the height of leaves in binary trees, J.Comb.Inf.Syst.Sci. 8(1983), 44–60.

    MathSciNet  MATH  Google Scholar 

  13. P. KIRSCHENHOFER, On the average shape of simply generated families of trees, J.Graph Th. 7 (1983), 311–323.

    Article  MathSciNet  MATH  Google Scholar 

  14. P. KIRSCHENHOFER, Some new results on the average height of binary trees, Ars Comb. 16A (1983), 255–260.

    MathSciNet  MATH  Google Scholar 

  15. P. KIRSCHENHOFER, On the average shape of monotonically labelled tree structures, Discr.Appl.Math. 7 (1984), 161–181.

    Article  MathSciNet  MATH  Google Scholar 

  16. P.KIRSCHENHOFER, H.PRODINGER, On the average height of monotonically labelled binary trees, in: Finite and infinite sets, Coll.Soc.Janos Bolyai, to appear.

    Google Scholar 

  17. P. KIRSCHENHOFER, H. PRODINGER, On the average hyperoscillations of planted plane trees, Combinatorica 2 (1982), 177–186.

    Article  MathSciNet  MATH  Google Scholar 

  18. P.KIRSCHENHOFER, H.PRODINGER, Recursion depth analysis for special tree traversal algorithms, in: Automata, languages and programming, Springer Lecture Notes in Computer Science 172 (1984), 303–311.

    Google Scholar 

  19. D.E. KNUTH, The art of computer programming, vol. 1, Addison Wesley, New York 1961.

    MATH  Google Scholar 

  20. A.MEIR, J.W.MOON, Climbing certain types of rooted trees I, Proc.5th Brit.Comb. Conf. 1975, 461–469.

    Google Scholar 

  21. A. MEIR, J.W. MOON, Climbing certain types of rooted trees II, Acta Math.Sci.Hungar. 31 (1978), 43–54.

    Article  MathSciNet  MATH  Google Scholar 

  22. A. MEIR, J.W. MOON, On the altitude of nodes in random trees, Canad.J.Math. 30 (1978), 997–1015.

    Article  MathSciNet  MATH  Google Scholar 

  23. A. MEIR, J.W. MOON, Terminal path numbers for certain families of trees, J.Austral. Math.Soc. (Ser.A) 31 (1981), 429–438.

    Article  MathSciNet  MATH  Google Scholar 

  24. K. MEHLHORN, Data structures and algorithms, vol.1,2,3, Springer, Berlin 1984.

    Google Scholar 

  25. J.W. MOON, The length of limbs in random trees, Mathematika 18 (1971), 78–81.

    Article  MathSciNet  MATH  Google Scholar 

  26. J.W.MOON, The distance between nodes in recursive trees, Proc.4th Brit.Comb.Conf. 1973, 125–132.

    Google Scholar 

  27. H. PRODINGER, The average height of a stack where three operatiohs are allowed and some related problems, J.Comb.Inf.Syst.Sci. 5 (1980), 287–304.

    MathSciNet  MATH  Google Scholar 

  28. H. PRODINGER, A note on a result of R.Kemp on r-tuply rooted planted plane trees, Computing 28 (1982), 363–366.

    Article  MathSciNet  MATH  Google Scholar 

  29. H. PRODINGER, F.J. URBANEK, On monotone functions of tree structures, Discr.Appl.Math. 5 (1983), 223–239.

    Article  MathSciNet  MATH  Google Scholar 

  30. A. RENYI, G. SZEKERES, On the height of trees, Austral.J.of Math. 1 (1967), 497–507.

    Article  MathSciNet  MATH  Google Scholar 

  31. F. RUSKEY, On the average shape of binary trees, SIAM J.Alg.Discr.Meth. 1 (1980), 43–50.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Abt. f. Diskrete Mathematik Inst. f. Algebra u. Diskrete Mathematik, Technische Universität Wien, Wiedner Hauptstr. 8-10, A-1040, Wien, Austria

    P. Kirschenhofer

Authors
  1. P. Kirschenhofer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Edmund Hlawka

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag

About this paper

Cite this paper

Kirschenhofer, P. (1985). Asymptotische Untersuchungen Zur Durchschnittlichen Gestalt Gewisser Graphenklassen. In: Hlawka, E. (eds) Zahlentheoretische Analysis. Lecture Notes in Mathematics, vol 1114. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0101644

Download citation

  • DOI: https://doi.org/10.1007/BFb0101644

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15189-0

  • Online ISBN: 978-3-540-39281-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation