Prüfer sequence
Summary
The Prüfer sequence encodes a labelled tree on vertices as a sequence of labels. This encoding is a bijection, and it proves Cayley's formula. The node Prüfer sequence gives the precise definition.
Further reading
- Web https://en.wikipedia.org/wiki/Prüfer_sequence, Algorithm to convert a tree into a Prüfer sequence
About this page
| Tag | 0GDQRETR59 |
|---|---|
| URI | m2://0GDQRETR59 |
| Kind | concept |
| Writing | W1 stated |
| MSC | 05C05 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.