Common · Knowledge
Prüfer sequence
Mathematical sequence
In combinatorial mathematics, the Prüfer sequence (also Prüfer code or Prüfer numbers) of a labeled tree is a unique sequence associated with the tree. The sequence for a tree on n vertices has length n − 2, and can be generated by a simple iterative algorithm.
From Wikipedia
In combinatorial mathematics, the Prüfer sequence (also Prüfer code or Prüfer numbers) of a labeled tree is a unique sequence associated with the tree. The sequence for a tree on n vertices has length n − 2, and can be generated by a simple iterative algorithm. Prüfer sequences were first used by Heinz Prüfer to prove Cayley's formula in 1918.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
-
★★
Gödel numbering
Assignment of each symbol and well-formed formula of a formal language a unique natural number
-
C★
Chain rule (probability)
Rule in probability
-
F★★
Faulhaber's formula
Expression for sums of powers
-
E★
Erdős conjecture on arithmetic progressions
Characterization of large sets
-
★
Padovan sequence
Sequence of integers
-
E★★
Einstein notation
Shorthand notation for tensor operations