Labeled Trees of 10 Vertices Using Prüfer Sequences

Initializing live version
Download to Desktop

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.


Enter a Prüfer code of length eight and the corresponding labeled tree of 10 vertices is drawn.


Contributed by: Csaba Rendek (Budapest University of Technology and Economics) (March 2011)
Open content licensed under CC BY-NC-SA




Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.