Hostname: page-component-cd9895bd7-gbm5v Total loading time: 0 Render date: 2024-12-28T01:26:13.741Z Has data issue: false hasContentIssue false
  • English
  • Français

A note on limbless trees

Published online by Cambridge University Press:  17 April 2009

K.L. McAvaney
K.L. McAvaney
Affiliation:
Mathematics Department, Gordon Institute of Technology, Geelong, Victoria.
Rights & Permissions [Opens in a new window]

Abstract

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.

It is shown by enumeration that for any two non-isomorphic limbs with the same number of points the number of trees with p points that contain one limb equals the number of trees with p points that contain the other.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 11 , Issue 3 , December 1974 , pp. 381 - 384
Copyright
Copyright © Australian Mathematical Society 1974

References

[1]Harary, Frank, Graph theory (Addison-Wesley, Reading, Massachusetts; London; Ontario; 1969).CrossRefGoogle Scholar
[2]McAvaney, K.L., “Counting stable trees”, Combinatorial mathematics (Proc. Second Austral. Conf., 79–85. Lecture Notes in Mathematics, 403. Springer-Verlag, Berlin, Heidelberg, New York, 1974).CrossRefGoogle Scholar
[3]Schwenk, Allen J., “Almost all trees are cospectral”, New directions in the theory of graphs (Proc. Third Ann Arbor Conf., Univ. Michigan, 1971, 275–307. Academic Press, New York, London, 1973).Google Scholar