Scribd
Upload
23 views

Graph Theory

The document discusses planar graphs and properties related to planarity. A graph is planar if it can be drawn in the plane without edge crossings. It provides examples of planar and nonplanar graphs. It also discusses Euler's formula that relates the number of regions, vertices and edges in a planar graph.

Uploaded by

Techstra 2020
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
23 views

Graph Theory

The document discusses planar graphs and properties related to planarity. A graph is planar if it can be drawn in the plane without edge crossings. It provides examples of planar and nonplanar graphs. It also discusses Euler's formula that relates the number of regions, vertices and edges in a planar graph.

Uploaded by

Techstra 2020
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 13

Graph Theory

Planar Graph

A graph is called planar if it can be drawn in the plane


without any edges crossing (where a crossing of
edges is the intersection of the lines or arcs
representing them at a point other than their
common endpoint). Such a drawing is called a
planar representation of the graph.

A graph may be planar even if it is usually drawn with


crossings, because it may be possible to draw it in a
different way without crossings
Is K4 (shown in Figure 2 with two edges crossing) planar?
Solution: K4 is planar because it can be drawn without crossings, as
shown in Figure 3.

Is Q3, shown in Figure 4, planar?


Solution: Q3 is planar, because it can be drawn without any
edges crossing, as shown in Figure 5.
Consider the problem of joining three houses to
each of three separate utilities, as shown in
Figure 1. Is it possible to join these houses
and utilities so that none of the connections
cross
We can show that a graph is planar by displaying a planar representation. It is
harder to show that a graph is nonplanar.

 Is K3,3, shown in Figure 6, planar?


Solution: Any attempt to draw K3,3 in the plane with no edges crossing is doomed. We now show why. In any
planar representation of K3,3, the vertices v1 and v2 must be connected to both v4 and v5. These four
edges form a closed curve that splits the plane into two regions, R1 and R2, as shown in Figure 7(a). The
vertex v3 is in either R1 or R2. When v3 is in R2, the inside of the closed curve, the edges between v3 and
v4 and between v3 and v5 separate R2 into two subregions, R21 and R22, as shown in Figure 7(b)

Next, note that there is no way to place the final vertex v6


without forcing a crossing. For if v6 is in R1, then the edge
between v6 and v3 cannot be drawn without a crossing. If
v6 is in R21, then the edge between v2 and v6 cannot be
drawn without a crossing. If v6 is in R22, then the edge
between v1 and v6 cannot be drawn without a crossing. A
similar argument can be used when v3 is in R1. The
completion of this argument is left for the reader (see
Exercise 10). It follows that K3,3 is not planar.
Show that K5 is non planar
K5 graph is complete graph with
5 vertices. In this graph edge v3-
v4 cannot be drawn through any
of the region without edge cross.
In the same way , v5-v2 edge
also cannot be drawn without
edge cross. So K5 is not a planar
graph.

To check whether a graph is planar or


not , use the formula

If
m<=3n-6 where m is the no. of edges
and n is the no. of vertices,
then the graph is planar graph.
In this graph, m=10,n=5, then 10<=3x5-6=
10<=9 (does not satisfy). So K5 is not planar
Applications of planar graph
 Design of electronic Circuits.
 In graph, components of circuit are vertices and
connections are edges.
 We can print a circuit on a single board with no connections
crossing if the graph representing the circuit is planar.
 Design of Road Networks
 Vertices representing the cities and edges representing the
highways connecting them.
 We can built this road network without using underpasses
or overpasses if the resulting graph is planar.
Euler’s Formula
A planar representation of a graph splits the plane into regions, including an unbounded region. Euler
showed that all planar representations of a graph split the plane into the same number of regions. He
accomplished this by finding a relationship among the number of regions, the number of vertices, and
the number of edges of a planar gr.
THEOREM 1: EULER’S FORMULA :
Let G be a connected planar simple graph with e edges and v vertices. Let r be the number of regions in a
planar representation of G. Then r = e − v + 2.
Proof: First, we specify a planar representation of G. We will prove the theorem by constructing a sequence of
subgraphs G1, G2,...,Ge = G, successively adding an edge at each stage. Arbitrarily pick one edge of G to
obtain G1. Obtain Gn from Gn−1 by arbitrarily adding an edge that is incident with a vertex already in
Gn−1, adding the other vertex incident with this edge if it is not already in Gn−1. This construction is
possible because G is connected. G is obtained after e edges are added. Let rn, en, and vn represent the
number of regions, edges, and vertices of the planar representation of Gn induced by the planar
representation of G, respectively. The relationship r1 = e1 − v1 + 2 is true for G1, because e1 = 1, v1 = 2,
and r1 = 1. This is shown in Figure 9.

Here e=1,v=2
r=1-2+2=1 region

Figure:G4 graph
Now assume that rk = ek − vk + 2. Let {ak+1,
bk+1} be the edge that is added to Gk to
obtain Gk+1.
There are two possibilities to consider.
 In the first case, both ak+1 and bk+1 are
already in Gk. These two vertices must be on
the boundary of a common region R
 In the second case, one of the two vertices of
the new edge is not already in Gk.
1. These two vertices must be on the boundary
of a common region R.
Here e=4,v=4
r=4-4+2=2 regions
R2 R1

The addition of this new edge splits R into two


Here e=5,v=4
regions. Consequently, in this case, rk+1 = rk + 1,
R=5-4+2=3 regions R2 ek+1 = ek + 1, and vk+1 = vk. Thus, each side of
R1 the formula relating the number of regions,
Formula Satisfies
edges, and vertices increases by exactly one, so
this formula is still true. I
R3
2. One of the two vertices of the new edge is
not already in Gk.
Here e=4,v=4
r=4-4+2=2 regions
R2 R1

Adding this new edge does not produce


any new regions, because bk+1 must be
Here e=5,v=5 in a region that has ak+1 on its boundary.
R=5-5+2=2 regions Consequently, rk+1 = rk. Moreover, ek+1
R1 = ek + 1 and vk+1 = vk + 1. Each side of
the formula relating the number of
regions, edges, and vertices remains the
R2 same, so the formula is still true.

You might also like