Hostname: page-component-586b7cd67f-rcrh6 Total loading time: 0 Render date: 2024-11-22T18:01:49.805Z Has data issue: false hasContentIssue false
  • English
  • Français

The enumeration of rooted trees by total height

Published online by Cambridge University Press:  09 April 2009

John Riordan  and
N. J. A. Sloane
John Riordan
Affiliation:
Rockefeller University
N. J. A. Sloane
Affiliation:
Cornell University
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The height (as in [3] and [4]) of a point in a rooted tree is the length of the path (that is, the number of lines in the path) from it to the root; the total height of a rooted tree is the sum of the heights of its points. The latter arises naturally in studies of random neural networks made by one of us (N.J.A.S.), where the enumeration of greatest interest is that of trees with all points distinctly labeled.

Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 10 , Issue 3-4 , November 1969 , pp. 278 - 282
Copyright
Copyright © Australian Mathematical Society 1969

References

[1]Austin, T. L., Fagen, R. E., Penney, W. F., and John, Riordan, ‘The number of components in random linear graphs’, Ann. Math. Statist. 30 (1959), 747–754.CrossRefGoogle Scholar
[2]Leo, Katz, ‘Probability of indecomposability of a random mapping function’, Ann. Math. Statist. 26 (1955), 512–517.Google Scholar
[3]John, Riordan, ‘The enumeration of trees by height and diameter’, I B M Jnl. Res. Dev. 4 (1960), 473–478.Google Scholar
[4]Rényi, A. and Szekeres, G., ‘On the height of trees’, J. Aust. Math. Soc. 7 (1967), 497–507.CrossRefGoogle Scholar
[5]John, Riordan, An Introduction to Combinatorial Analysis, (Wiley, New York, 1958).Google Scholar
[6]Salié, H., ‘Über Abel's Verallgemeinerung der binomischen Formel’, Ber. Verh. Säch. Akad. Wiss. Leipzig Math. — Nat. Kl. 98, No. 4 (1951) 19–22.Google Scholar
[7]Pólya, G., ‘Kombinatorische Anzahlbestimmungen für Gruppen, Graphen, und chemische Verbindungen’, Acta Math. 68 (1937), 145–253.CrossRefGoogle Scholar
[8]Watson, G. N., ‘Theorems stated by Ramanujan (V): Approximations connected with e x, Proc. London Math. Soc. (2), 29 (1929), 293–308.CrossRefGoogle Scholar