Article contents
On the representation and enumeration of trees
Published online by Cambridge University Press: 24 October 2008
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
References
REFERENCE
- 6
- Cited by