File:Cayley ordered Bell trees.svg

Summary

Description
English: 13 plane trees with four ordered leaves, with all root-leaf paths the same length and with different numbers of nodes at each level. The gaps between leaves are labeled by the height above the leaves of the lowest common ancestor of the two adjacent leaves; these heights induce a weak ordering of the gaps. As shown by Arthur Cayley in 1859, the trees of this type are counted by the ordered Bell numbers.
Date
Source Own work
Author David Eppstein

Licensing

I, the copyright holder of this work, hereby publish it under the following license:
Creative Commons CC-Zero This file is made available under the Creative Commons CC0 1.0 Universal Public Domain Dedication.
The person who associated a work with this deed has dedicated the work to the public domain by waiving all of their rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law. You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.

Category:CC-Zero#Cayley%20ordered%20Bell%20trees.svgCategory:Self-published work
Category:Tree structures Category:Weak ordering of a 3-set Category:Star graph S4 Category:Graphs with 7 vertices Category:Graphs with 8 vertices Category:Graphs with 10 vertices
Category:CC-Zero Category:Graphs with 10 vertices Category:Graphs with 7 vertices Category:Graphs with 8 vertices Category:Self-published work Category:Star graph S4 Category:Tree structures Category:Weak ordering of a 3-set