A plane tree has one face of a plane graph, so its dual graph has one vertex. Every original edge is a bridge incident to that same face on both sides, so every dual edge is a loop. Thus the dual drawing in the figure is a bouquet of eight loops, arranged with the displayed nesting inherited from the tree. It has nine faces of a plane graph, matching . The nesting matters for which faces meet; a bouquet drawn as eight unrelated petals would have a different face-adjacency graph.

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