The enumeration of rooted trees by total height
- 1 November 1969
- journal article
- research article
- Published by Cambridge University Press (CUP) in Journal of the Australian Mathematical Society
- Vol. 10 (3-4) , 278-282
- https://doi.org/10.1017/s1446788700007527
Abstract
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.Keywords
This publication has 5 references indexed in Scilit:
- On the height of treesJournal of the Australian Mathematical Society, 1967
- The Number of Components in Random Linear GraphsThe Annals of Mathematical Statistics, 1959
- Probability of Indecomposability of a Random Mapping FunctionThe Annals of Mathematical Statistics, 1955
- Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische VerbindungenActa Mathematica, 1937
- Theorems Stated by Ramanujan (V): Appronimations Connected with cxProceedings of the London Mathematical Society, 1929