Labeled Trees of 10 Vertices Using Prüfer Sequences

Requires a Wolfram Notebook System
Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.
A Prüfer code is a unique sequence of integers associated with a labeled tree. The code can be generated by iteratively removing the leaf with the smallest label and setting the next element to be the label of its neighbor.
[more]
Contributed by: Csaba Rendek (Budapest University of Technology and Economics) (March 2011)
Open content licensed under CC BY-NC-SA
Snapshots
Details
detailSectionParagraphPermanent Citation
"Labeled Trees of 10 Vertices Using Prüfer Sequences"
http://demonstrations.wolfram.com/LabeledTreesOf10VerticesUsingPruferSequences/
Wolfram Demonstrations Project
Published: March 7 2011