✳flâneur — a map of the web's best reading

Dual graph

en.wikipedia.org · 7,190 words · saved by 1 readers

In the mathematical discipline of graph theory, the dual graph of a plane graph G is a graph that has a vertex for each face of G. The dual graph has an edge for each pair of faces in G that are separated from each other by an edge, and a self-loop when the same face appears on both sides of an edge. Thus, each edge e of G has a corresponding dual edge, whose endpoints are the dual vertices corresponding to the faces on either side of e. The definition of the dual depends on the choice of embedding of the graph G, so it is a property of plane graphs (graphs that are already embedded in the plane) rather than planar graphs (graphs that may be embedded but for which the embedding is not yet known). For planar graphs generally, there may be multiple dual graphs, depending on the choice of planar embedding of the graph.

Dual graph - Wikipedia Jump to content From Wikipedia, the free encyclopedia Graph representing faces of another graph The red graph is the dual graph of the blue graph, and vice versa . In the mathematical discipline of graph theory , the dual graph of a planar graph G is a graph that has a vertex for each face of G . The dual graph has an edge for each pair of faces in G that are separated from each other by an edge, and a self-loop when the same face appears on both sides of an edge. Thus, each edge e of G has a corresponding dual edge, whose endpoints are the dual vertices corresponding to

Explore this link on the map →

related reading