gives the dual of the planar graph g.
Details and Options
- DualPlanarGraph is also known as geometric dual graph and combinatorial dual graph.
- DualPlanarGraph is typically used to associate dual structures such as flow and cellular networks, or Voronoi and Delaunay diagrams.
- DualPlanarGraph[g] gives a graph that has a vertex for each face of g and an edge for each pair of faces separated from each other by an edge.
- DualPlanarGraph takes the same options as Graph.
Examplesopen allclose all
Basic Examples (2)
The three-dimensional HypercubeGraph is planar:
DualPlanarGraph works with undirected graphs:
Properties & Relations (2)
Use PlanarFaceList to get the faces of planar graphs:
Use FindPlanarColoring to find a coloring for the faces of planar graphs:
Possible Issues (2)
DualPlanarGraph depends on faces based on the given layout:
DualPlanarGraph depends on faces based on the given coordinates:
Wolfram Research (2021), DualPlanarGraph, Wolfram Language function, https://reference.wolfram.com/language/ref/DualPlanarGraph.html.
Wolfram Language. 2021. "DualPlanarGraph." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/ref/DualPlanarGraph.html.
Wolfram Language. (2021). DualPlanarGraph. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/DualPlanarGraph.html