Planted Planar Tree

A planted plane tree is defined as a vertex set , edges set , Root , and orderrelation on which satisfies

1. For if , then , where is the length of the path from to ,

2. If , , and , then

References

Chorneyko, I. Z. and Mohanty, S. G. ``On the Enumeration of Certain Sets of Planted Plane Trees.'' J. Combin. Th. Ser. B 18, 209-221, 1975.

Harary, F.; Prins, G.; and Tutte, W. T. ``The Number of Plane Trees.'' Indag. Math. 26, 319-327, 1964.

Klarner, D. A. ``A Correspondence Between Sets of Trees.'' Indag. Math. 31, 292-296, 1969.

• Zassenhaus-Berlekamp Algorithm
• z-Axis
• z-Distribution
• Zeckendorf Representation
• Zeckendorf's Theorem
• Zeeman's Paradox
• Zeilberger's Algorithm
• Zeisel Number
• Zeno's Paradoxes
• Zermelo-Fraenkel Axioms
• Zermelo-Fraenkel Set Theory
• Zermelo's Axiom of Choice
• Zermelo Set Theory
• Zernike Polynomial
• Zero
• Zero Divisor
• Zero (Root)
• Zero-Sum Game
• Zeta Fuchsian
• Zeta Function
• Zeuthen's Rule
• Zeuthen's Theorem
• Zig Number
• Zigzag Permutation
• Zig-Zag Triangle