Prüfer Codes of Labeled Trees

Requires a Wolfram Notebook System
Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.
In 1889, Cayley proved that there are labeled trees on
nodes. In 1918, Prüfer found a method for constructing each tree.
Contributed by: Ed Pegg Jr (March 2011)
Open content licensed under CC BY-NC-SA
Snapshots
Details
The smallest non-branch number is 1. Cut it from 2. The smallest non-branch number is 3. Cut it from 8. The smallest non-branch number is 5. Cut it from 9. The smallest non-branch number is 6. Cut it from 4. The smallest non-branch number is 4. Cut it from 7. The smallest non-branch number is 8. Cut it from 7. The smallest non-branch number is 7. Cut it from 2.
Permanent Citation
"Prüfer Codes of Labeled Trees"
http://demonstrations.wolfram.com/PruferCodesOfLabeledTrees/
Wolfram Demonstrations Project
Published: March 7 2011