Twenty-step algorithm for determining the asymptotic number of trees of various speces
- 1 November 1975
- journal article
- research article
- Published by Cambridge University Press (CUP) in Journal of the Australian Mathematical Society
- Vol. 20 (4) , 483-503
- https://doi.org/10.1017/s1446788700016190
Abstract
The technique for finding for asymptotic number of unlabled trees of various sorts was developed by pólya (1973) and perfected by Otter (1848). Modern presentations are available in the book of Harary and Palmer (1973; Chapter 9), and in the paper of Bender (to appear).Keywords
This publication has 4 references indexed in Scilit:
- The number of homeomorphically irreducible trees, and other speciesActa Mathematica, 1959
- The numbers of labeled colored and chromatic treesActa Mathematica, 1957
- The Number of TreesAnnals of Mathematics, 1948
- Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische VerbindungenActa Mathematica, 1937