E = pruferSequence L
Cayley's formula in graph theory is the result that the number of trees with vertices labelled from $0$ to $n-1$ is $n^{n-2}$. The Prüfer sequence of a labelled tree is an element of $\{0, \dots, n-1\}^{n-2}$ and gives an explicit bijection between the two sets.
This function produces the edge set of the spanning tree corresponding to a given Prüfer sequence.
|
|
|
The object pruferSequence is a method function.
The source of this document is in AllMarkovBases.m2:827:0.