Labeled Trees of 10 Vertices Using Prüfer Sequences

A Prüfer code is a unique sequence of integers associated with a labeled tree. The code can be generated by iteratively removing the leaf with the smallest label and setting the next element to be the label of its neighbor.
Enter a Prüfer code of length eight and the corresponding labeled tree of 10 vertices is drawn.
  • Contributed by: Csaba Rendek (Budapest University of Technology and Economics)

SNAPSHOTS

  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.