The Prufer sequence, also called the Prufer code or Prufer numbers, of a labeled tree is a unique sequence associated with the tree, generated by a simple iterative algorithm; a sequence for a tree on n vertices has length n minus 2. Prufer sequences were first used by Heinz Prufer to prove Cayley's formula, which counts the number of labeled trees on a given number of vertices, in 1918.
Connections
In Field
Source Prüfer sequence (Wikipedia)
Sources
Prüfer sequence (Wikipedia)
In Field: Algorithms and Complexity Theory, LeadQuote, In Field: Algorithms and Complexity Theory, Lead
The sequence for a tree on n vertices has length n − 2, and can be generated by a simple iterative algorithm.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.