Hostname: page-component-cd9895bd7-fscjk Total loading time: 0 Render date: 2024-12-24T14:16:28.563Z Has data issue: false hasContentIssue false
  • English
  • Français

On the representation and enumeration of trees

Published online by Cambridge University Press:  24 October 2008

Stephen Glicksman
Stephen Glicksman
Affiliation:
Univac Division, Sperry Rand Corporation, New York
Get access Rights & Permissions [Opens in a new window]

Abstract

Scoins(1) has shown that if Π1 = {(1), …, (n)} and Π2 = {(n + 1), …, (n + m)} are two sets of points, there are exactly mn−1nm−1 trees of alternate parity connecting the points of Π1 ∪ Π2, where each tree consists of n + m − 1 segments and each segment joins a point of Π1 to a point of Π2. Another proof based on the three following results is given here.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 59 , Issue 3 , July 1963 , pp. 509 - 517
Copyright
Copyright © Cambridge Philosophical Society 1963

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCE

(1)Scoins, H. I., Trees with nodes of alternate parity. Proc. Cambridge Philos. Soc. 58 (1962), 12–16.CrossRefGoogle Scholar