Dual graph
id:
dual-graph-243-11131053
title:
Dual graph
text:
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 the faces on either side of e. The definition of the dual depends on the choice of embe
brand slug:
wiki
category slug:
encyclopedia
description:
Graph representing faces of another graph
original url:
https://en.wikipedia.org/wiki/Dual_graph
date created:
date modified:
2024-01-03T02:26:46Z
main entity:
{"identifier":"Q2294516","url":"https://www.wikidata.org/entity/Q2294516"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/b/ba/Duals_graphs.svg","width":313,"height":223}
fields total:
13
integrity:
15