Hostname: page-component-7c8c6479df-24hb2 Total loading time: 0 Render date: 2024-03-26T11:47:42.052Z Has data issue: false hasContentIssue false

Twenty-step algorithm for determining the asymptotic number of trees of various speces*

Published online by Cambridge University Press:  09 April 2009

Frank Harary
Affiliation:
University of MichiganAnn Arbor, Michigan, U.S.A.
Robert W. Robinson
Affiliation:
University of NewcastleNew South Wales, Australia
Allen J. Schwenk
Affiliation:
Michigan State UniversityEast Lansing, Michigan, U.S.A.
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 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).

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1975

References

Bender, E. A. (to appear), ‘Asymptotic methods in enumeration’.Google Scholar
Harary, F. and Palmer, E. M. (1973), Graphical Enumeration (Academic Press, New York, 1973).Google Scholar
Harary, F. and Prins, G. (1959), ‘The number of homeomorphically irreducible trees, and other species’, Acta Math. 101, 141162.Google Scholar
Hille, E. (1959), Analytic Function Theory, Vol. I (Ginn, Boston, 1959).Google Scholar
Otter, R. (1948), ‘The number of trees’, Ann. of Math. 49, 583599.Google Scholar
Pólya, G. (1937), ‘Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen’, Acta Math. 68, 145254.Google Scholar
Riordan, J. (1957), ‘The number of labelled colored and chromatic trees’, Acta Math. 97, 211225.Google Scholar
Whittaker, E. T. and Watson, G. N. (1943), A Course of Modern Analysis (Fourth Edition, Cambridge Univ. Press, Cambridge, 1943).Google Scholar