The weak dual of a plane graph is the subgraph of the dual graph whose vertices correspond to the bounded faces of the primal graph. A plane graph is outerplanar if and only if its weak dual is a forest, and a plane graph is a Halin graph if and only if its weak dual is biconnected and outerplanar. For any plane graph G, let G+ be the plane multigraph formed by adding a single new vertex v in the unbounded face of G, and connecting v to each vertex of the outer face (multiple times, if a vertex appears multiple times on the boundary of the outer face); then, G is the weak dual of the (plane) dual of G+.
Read more about this topic: Dual Graph
Famous quotes containing the words weak and/or dual:
“Chile consents to do all we can reasonably demand. My regret is that our Government blustered and bullied. President [Benjamin] Harrison argued in his message like a prosecutor—made the most of the case against our weak sister. Forbearance, charity, friendship, arbitration should have been in our words and thoughts.”
—Rutherford Birchard Hayes (1822–1893)
“Thee for my recitative,
Thee in the driving storm even as now, the snow, the winter-day
declining,
Thee in thy panoply, thy measur’d dual throbbing and thy beat
convulsive,
Thy black cylindric body, golden brass and silvery steel,”
—Walt Whitman (1819–1892)