◀ ▲ ▶Branches / Graphtheory / Corollary: Number of Vertices, Edges, and Faces of a Dual Graph
Corollary: Number of Vertices, Edges, and Faces of a Dual Graph
(related to Definition: Dual Planar Graph)
Let $G$ be a connected planar graph with a planar drawing $\mathcal D,$ and with $V$ vertices, $E$ edges and $F$ faces.
If $G^*_{\mathcal D}$ is its dual graph, then $G^*_{\mathcal D}$ has $F$ vertices, $E$ edges and $V$ faces.
Table of Contents
Proofs: 1
Mentioned in:
Explanations: 1
Thank you to the contributors under CC BYSA 4.0!
 Github:

References
Bibliography
 Aldous Joan M., Wilson Robin J.: "Graphs and Applications  An Introductory Approach", Springer, 2000