Definition:Prüfer Sequence
From ProofWiki
Definition
A Prüfer sequence (or Prüfer code) of order $n$ is a sequence of integers:
- $\left({\mathbf{a}_1, \mathbf{a}_2, \ldots, \mathbf{a}_{n-2}}\right)$
such that $\forall i: 1 \le i \le n-2: 1 \le \mathbf{a}_i \le n$.
That is, it is a sequence of $n-2$ integers between $1$ and $n$.
The concept was defined for the purposes of demonstrating a proof of Cayley's Formula.
Source of Name
This entry was named for Heinz Prüfer.
