WOLFRAM|DEMONSTRATIONS PROJECT

Labeled Trees of 10 Vertices Using Prüfer Sequences

​
x
1
1
2
3
4
5
6
7
8
9
10
x
2
1
2
3
4
5
6
7
8
9
10
x
3
1
2
3
4
5
6
7
8
9
10
x
4
1
2
3
4
5
6
7
8
9
10
x
5
1
2
3
4
5
6
7
8
9
10
x
6
1
2
3
4
5
6
7
8
9
10
x
7
1
2
3
4
5
6
7
8
9
10
x
8
1
2
3
4
5
6
7
8
9
10
{1,1,1,1,1,1,1,1}
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.