Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-25T09:09:08.525Z Has data issue: false hasContentIssue false
  • English
  • Français

Twenty-step algorithm for determining the asymptotic number of trees of various species: corrigenda

Part of: Graph theory

Published online by Cambridge University Press:  09 April 2009

Frank Harary ,
Robert W. Robinson  and
Allen J. Schwenk
Frank Harary
Affiliation:
Department of Mathematics, University of Michigan Ann Arbor, Michigan 48109, U.S.A.
Robert W. Robinson
Affiliation:
Department of Computer Science, University of Georgia Athens, Georgia 30602, U.S.A.
Allen J. Schwenk
Affiliation:
Department of Mathematics, Western Michigan University Kalamazoo, Michigan 49008, 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.

John W. Moon has discovered several computational errors in our article above (J. Austral. Math. Soc. (Series A) 20 (1975), 483–503). The five constants reported for identity trees below Table 1 at the bottom of page 502 are all wrong. The correct values are

MSC classification

Secondary: 05C05: Trees
Type
Corrigenda
Information
Journal of the Australian Mathematical Society , Volume 41 , Issue 3 , December 1986 , pp. 325
Copyright
Copyright © Australian Mathematical Society 1986