Take a root with children . Give the children , give the children , and give the children . The root of a tree has degree two, the three vertices have degree three, and are the five leaves of a graph. There are nine vertices and eight edges, as required by the handshaking lemma and the edge count for a tree.
Figure 1.
A plane tree and its one-vertex dual graph, with two alternating face colours
. Details.

Ancestors (13)

  1. iv
  2. 2
  3. R
  4. 2007
  5. Past exam of the Probability, statistics and options II course of the University of Oxford
  6. Probability, statistics and options II course of the University of Oxford
  7. Year 2 of the mathematics and statistics course of the University of Oxford
  8. Mathematics and statistics course of the University of Oxford
  9. Undergraduate course of the University of Oxford
  10. Course of the University of Oxford
  11. University of Oxford
  12. List of universities
  13. 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