dual graph


Also found in: Wikipedia.

dual graph

[¦dü·əl ′graf]
(mathematics)
A planar graph corresponding to a planar map obtained by replacing each country with its capital and each common boundary by an arc joining the two countries.
References in periodicals archive ?
Next we construct a dual graph of D by converting the dark regions in D into vertices in a graph G and converting the crossings in D between two dark regions into edges incident to the corresponding vertices in G.
x,y] be the geometric dual graph of the plane graph [G.
The four regions 00, 01, 10 and 11 in that figure are the nodes of the dual graph [ILLUSTRATION FOR FIGURE 1 OMITTED] [C.
The facets 12 and 13 with the vertices {0, 2, 5, 7, 8} and {1, 2, 5, 7, 8}, respectively, are adjacent in the dual graph (via the common ridge with vertex set {2, 5, 7,8}).