Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Prüfer sequence
open-in-new
<p>In <a href="/facts/Combinatorics/k14xUoKT">combinatorial</a> <a href="/facts/Mathematics/pxTouaz4">mathematics</a>, the Prüfer sequence (also Prüfer code or Prüfer numbers) of a <a href="/facts/Labeled_tree/TCWk4Joy">labeled tree</a> is a unique <a href="/facts/Sequence/gV2S4uqp">sequence</a> associated with the tree. The sequence for a tree on n vertices has length <i>n</i> − 2, and can be generated by a simple iterative algorithm. Prüfer sequences were first used by <a href="/facts/Heinz_Pr%25C3%25BCfer/taYPqKkP">Heinz Prüfer</a> to prove <a href="/facts/Cayley%2527s_formula/fwjWPJTf">Cayley's formula</a> in 1918. </p>