Example: air traffic controller
G V;E

G V;E

Back to document page

We define its dual G = (V ;E )as follows: There is a vertex f correspond-ing to each face f of G. There is an edge e corresponding to each edge e of G. f and g are joined by edge e iff edge e is on the boundary of f and g. Cut edges yield loops. Theorem 1 (a) G is planar.

  G v e

Download G V;E


Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement

Related search queries