1

Graph theory: Module-4

Planar Graphs: Planar graphs, Kuratowski’s theorem
(proof not required), Different representations of planar
graphs, Euler's theorem, Geometric dual.

Graph Representations: Matrix representation of

graphs-Adjacency matrix, Incidence Matrix, Circuit
Matrix, Path Matrix.
Combinatorial and Geometric Graphs2
3
 Planar Graphs 4
 A graph is said to be planar if it can be drawn in a plane so
that no edge cross.

It is the type of graph that can be drawn in a plane with

no edge overlap or cross each other.

If we draw graph in the plane without edge crossing,

it is called embedding the graph in the plane.
 For example, this is a planar graph:
5

The graphs are the same, so if

one is planar, the other must
be too. However, the original
drawing of the graph was not
a planar representation of the
graph.

When a planar graph is drawn without edges crossing,

the edges and vertices of the graph divide the plane into
regions.
Definition 6

A graph G is said to be planar if there exists

some geometric representation ofG which
can be drawn on a plane such that no two of
its edges intersect.
Draw a planar graph with 7

4 vertices
Each vertex is connected to each other
by an edge without hitting each
other,hence it is planar

Planar Graph
 Non-Planar Graph 8
 A graph that cannot be drawn on a plane without a
crossover between its edges is called nonplanar.
9
Check k5 is planar or non-planar 10
graph

K5: K5 has 5 vertices and 10 edges, and thus it is not planar.

 KURATOWSKI’S TWO GRAPHS 11
THEOREM : The complete graph of five vertices is nonplanar
12
 13
THEOREM:Kuratowski’s second graph is also nonplanar.
OR The complete bipartite graph K3,3 is nonplanar.
NOTE: 14
 15

DIFFERENT REPRESENTATIONS
OF A PLANAR GRAPH
Region:
 A regions/faces /meshes/windows is defined as16 the
area of the plane in the graph which is enclosed or
surrounded by edges and can not be subdivided
further.
 A Plane graph divides the plane into regions(also
called windows, faces or meshes). A region is
characterised by the set of edges (or the set of
vertices) forming its boundary.
 A planar graph divides the graph into one or more
regions, one of which is an infinite region. Finite and
infinite areas,
Finite Region 17
 If the area of the region in the graph or any plane is
finite, then it is known as finite region.
 The planar graph can have more than one finite
region.

Infinite Region
 If the area of the region in the graph or any plane is
infinite, then it is known as infinite region.
 The portion of the plane lying outside a graph
embedded in a plane.
 The planar graph has only one infinite region.
 The number of edges that form the boundary of a
region is called the degree of that region.
18
Find the degree of the 19
Regions

deg(R1) = 4 deg(R2) = 5
Consider the graph given below. Find 20
the name and number of finite and
infinite regions.
 21

There are five regions present in the above graph r1, r2, r3, r4, r5.
Among the above five regions, r2, r3, r4, r5 are the finite region.
Whereas r1 is the infinite region.
Show That a graph of 22

order 5 and size 8 are

planar graphs
Show That a graph of order 5 and size 8 are planar 23
graphs
Show That a graph of 24

order 6 and size 12 are

planar graphs
Show That a graph of order 6 and 25
size 12 are planar graphs
Show that the complete 26
graphs K2, K3 and K4 are
planar graphs
27
Show that the bipartite graphs K2,2 and 28
K2,3 are planar graphs
 29

K2,2 K2,3
V1={v1,v2} V1={v1,v2}
V2={v3,v4} V2={v3,v4,v5}
In the above figure the edges meet In the above figure the edges meet
only at the vertices only at the vertices
Find the region and 30

degree of each region

Prove that the complete graph 31
K5(the Kuratowski first graph) is a
non-planar.
Check whether the following graph is 32
planar or non-planar
33
Check whether the following 34
graph is planar or non-planar and
check the degree of each region
Prove that the complete bipartite graph 35
K3,3(the Kuratowski’s second graph) is a non-
planar.
36
37
38
39
 Kuratowski's Theorem 40
 Every non-planar graph has a subgraph that is
homeomorphic to K3,3 or K5.

 Let G be a graph. Then G is nonplanar if and only if

G contains a subgraph that is a subdivision of either
K3,3 or K5.
 A
41
B

Consider a graph G as shown in above figure , try to divide the graph.

This is done by adding new vertex.

A C B

Now it has become two graphs.

The graph G and G` has become Homeomorphic graphs.
Find the Homeomorphic graph of 42
following
43
44
 Kuratowski's Graph 45
 Two specific non-planar graphs are called Kuratowski’s graph.

 A complete graph with 5 vertices (k5) is Kuratowski firsrt graph

 The second is a regular, connected graph with 6 vertices and 9

edges (k3,3)
46
47
48
49
50
 Eulers’s Formula 51
If G is a planar graph, then G can be represented by
a diagram in a plane in which the edges meet only at
the vertices. Such a diagram divides the plane into a
number of parts called regions or faces of which
exactly one part is unbounded.
The number of edges that form the boundary of a
region is called the degree of that region.
Find the degrees of the regions ?
52

d(R1)=2
d(R2)= d(R4)=3
Boundary of Region R3 has 4 edges of which one is a
pendant vertex. d(R3)=5
The region R5 is bounded by a single edge loop
d(R5)=1
d(R6)=6
Sum of all degrees = 20
i.e twice the number of edges in the graph
 53

Theorem: A connected planar graph G with n vertices and

m edges has exactly m-n+2 regions in allof its diagrams.
Proof: n-m+r =2
r=m-n+2
Verify Eulers formaula for the planar graph
54

n= 6 vertices, m=10 edges ,r=6 regions

n-m+r=2
6-10+6=2
2=2
Eulers formula is verified.
 55

deg(R1) = 4
deg(R2) = 6 (Pendant edge is counted twice)
56
57
58
d(R1)=3 59
d(R2)=5
d(R3)=3
d(R4)=7

Sum=18
= twice the number of edges
60
A connected planar graph G has 9 vertices 61
with degrees 2,2,3,3,3,4,5,6,6. Find the number
of regions

 We have n=9,
By handshaking property we have
2m=sum of degrees of vertices
= 2+2+3+3+3+4+5+6+6
2m =34

Number of edges m=17

By Eulers formula , r=m-n+2
r= 17-9+2
= 10
 62
 If G is connected ,simple
planar graph with n(>=3)
vertices and ,m(>2) edges and
r regions then
1) m>=3/2r and
2) m<=3n-6
 Geometric Dual/Dual of a planar graph
63
 Consider a connected planar graph G .
 Suppose R1,R2,R3… are the regions .
 Let us construct a graph G* using the procedure given below:
64
65
66
67
68
2) 69
More Problems 70
MATRIX REPRESENTATION 71

OF GRAPHS
 Matrix is a convenient and useful way of
representing a graph to a computer.

 Matrix representation of graphs-Adjacency matrix,

Incidence Matrix, Circuit Matrix, Path Matrix.
 ADJACENCY MATRIX 72
 an adjacency matrix is nothing but a square matrix utilised to
describe a finite graph.
 The adjacency matrix, also called the connection matrix, is a
matrix containing rows and columns which is used to represent a
simple labelled graph, with 0 or 1 in the position of (Vi , Vj)
according to the condition whether Vi and Vj are adjacent or
not.
 The adjacency matrix of a graph G with n vertices
and no parallel edges is an n by n symmetric binary
matrix X = [xij] defined over the ring of integers such
that
xij = 1, if there is an edge between ith and jth vertices,
and
= 0, if there is no edge between them.
73
From the given directed 74
graph, the adjacency matrix is
written as
75
76
77
 Matrix Powers in 78

Adjacency Matrix
 The most well-known approach to get information
about the given graph from operations on this matrix
is through its powers. The entries of the powers of the
matrix give information about paths in the given
graph.
 The number of edge sequences of length k between
two vertices in a graph.
 Theorem: Let us take, A be the connection matrix of a given
graph. Then the entries i, j of An counts n-steps walks from vertex
i to j.
Matrix power of 2 symmetric matrix X2 79
compute is also a 80
symmetric matrix, X3 is a symmetric
matrix.
INCIDENCE MATRIX 81
 82

 Such a matrix A is called the vertex-edge incidence matrix, or

simply incidence matrix. Matrix A for a graph G is sometimes
also written as A(G).
 83
 The incidence matrix contains only two elements, 0 and 1.
Such a matrix is called a binary matrix or a (0, 1)-matrix.
 Given any geometric representation of a graph
Without self-loops, we can readily write its incidence matrix.

 On the other hand, if we are given an incidence matrix

A(G), we can construct its geometric graph G without
ambiguity.
 The incidence matrix and the geometric graph contain the
same information†—they are simply two alternative ways of
representing the same (abstract) graph.
The following observations about the incidence matrix
A can readily be made 84
 CIRCUIT MATRIX 85
 Let the number of different circuits in a graph G be q and the
number of edges in G be e. Then a circuit matrix B = [bij] of G is
a q by e, (0, 1)-matrix defined as follows:
86
87
88
PATH MAtrix 89

 A path matrix is defined for a specific pair of vertices in a

graph, say (x, y), and is written as P(x,y). The rows in P(x, y)
correspond to different paths between vertices x and y, and
the columns correspond to the edges in G. That is, the path
matrix for (x, y) vertices is P(x, y)= [pij], where
pij = 1, if jth edge lies in ith path, and
= 0, otherwise.
consider all paths between vertices v3 and v4 in Fig.
There are three different paths; {h, e}, {h, g, c}, and 90
{h,f,d,c}. Let us number
them 1, 2, and 3, respectively. Then we get the 3 by 8
path matrix P(v3, v4):
Write down the Path matrix and 91
Circuit matrix for the given graph.