Math 2.0

concept

Prüfer sequence

Summary

The Prüfer sequence encodes a labelled tree on nn vertices as a sequence of n−2n - 2 labels. This encoding is a bijection, and it proves Cayley's formula. The node Prüfer sequence gives the precise definition.

What this node 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 node is. They do not measure its truth.

Sources

  1. Web https://en.wikipedia.org/wiki/Prüfer_sequence, Algorithm to convert a tree into a Prüfer sequence

What links here

Definitions