Graph

Nitin Upadhyay
March 06, 2006
Example 1

 Findout the interior and exterior regions,

degree of each region and total degree of the
planar graph G. Interior regions:
1:{a-b-g-h-a} 2:{b-c-f-g-b}
a b c d 3:{c-d-e-f-c} degree: {4}
Exterior region
1: {a-b-c-d-e-f-g-h-a}
h g f e Degree: {8}
Total degree: 8 + (4 * 3) = 20
Number of edges: 20/2 = 10
Example 2

 Findout the interior and exterior regions,

degree of each region and total degree of the
planar graph G. Interior regions:

a 1:{b-d-c-b} 2:{e-f-g-e}
f degree: {3}
Exterior region
b d e
1: {a-b-c-d-e-f-g-e-d-b-a}
g Degree: {10}
c Total degree: 10 + (2 * 3) = 16
Duality

 Let G be an embedding of a planar graph on

the plane.
 Geometric dual of the plane graph G can be
constructed.
 It is not necessary that two different
geometric (corresponding to two different
embeddings) are isomorphic.
Steps for Obtaining Dual Graphs

 Each region of G corresponds to a vertex of

G’.
 If e is an edge of G that has region X on one
side and region Y on the other, the
corresponding dual edge e’ is an edge
joining vertices x and y, which correspond to
X and Y, respectively.
 There is a path between every pair of
vertices in the dual graph.
Example 1

 Obtain dual graph for the following graph G:

A
5 2
B

F 6 E 1 C

D
4 3
Example 1

 Dual Graph

A
5 2
B

F 6 E 1 C

D
4 3
Example 1

 Dual graph

A
5 2 B
B

F 6 E 1 C E F A C

D
4 3 D
Example 2

 Find dual graph for the following

A
1

F
B C
2 3
E

6
D
5 4
Example 2

 Dual graph

A
1

F
B C
2 3
E

6
D
5 4
 Example 2

 Dual graph

A
1
A
F
B C
2 3 D
E C
B
6 E
D
5 4
F
Points to remember

For all plane graphs:

 | E* | = | E |
 | V* | = | R |
 deg* (r*) = deg (r) for each region of r of G.

If G is connected,
| R* | = | V |
Euler’s Formula

 If G is a connected plane graph, then:

| V | - | E | + | R | = 2.

Corollary:
In a connected plane (simple) graph G, with | E | >
1,
 |E|≤3|V|-6
 There is a vertex v of G such that degree (v) ≤ 5.
Theorem

A complete graph Kn is planar iff n ≤ 4.

[ Hint: | R | + | V | - | E | + 2, 3 | R | ≤ 2 | E | ]

A complete bipartitte graph Km,n is planar iff

m ≤ 2 or n ≤ 2.
Questions Questions ?