Take root one, its children two and three, the children of two to be four and five, and those of three to be six and seven. Its edge set is . The root has degree two, vertices two and three have degree three, and the remaining vertices have degree one.
Removing the smallest available leaves in order gives , with recorded neighbors . Therefore its Prüfer code is
(1)
Figure 1.
A labelled seven-vertex rooted binary tree with root one
. Details.

Ancestors (12)

  1. 1
  2. R
  3. 2008
  4. Past exam of the probability, statistics and options I course of the University of Oxford
  5. Probability, statistics and options I course of the University of Oxford
  6. Year 2 of the mathematics and statistics course of the University of Oxford
  7. Mathematics and statistics course of the University of Oxford
  8. Undergraduate course of the University of Oxford
  9. Course of the University of Oxford
  10. University of Oxford
  11. List of universities
  12. Home

View article source

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version