|WikiProject Mathematics||(Rated C-class, Low-priority)|
The figure on this page is not very useful for someone trying to understand Prüfer sequences. I believe it is too simple.
For instance, how would one proceed if the nodes labelled 3 and 4 were relabelled 4 and 3? Would the sequence then be 3335, or 3345? I presume the former because the later would result in a disconnected graph? It would be helpful if this were made explicit.
Ray 06:06, 26 February 2006 (UTC)
It says explicitly "remove the leaf with the smallest label". Therefore there is no ambiguity.
In the "Other Applications" section, there appears to be a mistake: in a complete n-order graph, every vertex has degree n-1. --Matt mcgill 15:44, 15 October 2007 (UTC)
Proof there is a 1-1 corespondence
Removed merge proposal
I removed the merge proposal because Prüfer's code is entirely different concept than the one employed in Cayley's proof. —Preceding unsigned comment added by 126.96.36.199 (talk) 13:55, 14 August 2008 (UTC)
Algorithm to convert a Prüfer sequence into a tree
For those interested, the French article proposes a second method to do the decoding. The array of degrees is replaced with an array of nodes that have not been examined yet.