Talk:Prüfer sequence
From Wikipedia, the free encyclopedia
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.
How you get the tree from the code? 150.244.52.8 (talk) 16:34, 19 January 2008 (UTC)
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)
