Scribd
Upload
858 views2 pages

Planar Graph:: Applications of Planar Graphs

A planar graph is one that can be drawn in a plane without any edge crossings. A planar representation is a drawing of a graph without edge crossings. Euler's formula states that for a connected planar simple graph with e edges and v vertices, the number of regions r equals e - v + 2. Planarity of graphs is important for designing electronic circuits and road networks where no connections can cross if the graph is planar.

Uploaded by

Saba Tanveer
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
858 views2 pages

Planar Graph:: Applications of Planar Graphs

A planar graph is one that can be drawn in a plane without any edge crossings. A planar representation is a drawing of a graph without edge crossings. Euler's formula states that for a connected planar simple graph with e edges and v vertices, the number of regions r equals e - v + 2. Planarity of graphs is important for designing electronic circuits and road networks where no connections can cross if the graph is planar.

Uploaded by

Saba Tanveer
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

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.

For example:

Fig 4

Q3 is planar, because it can be drawn without any edges crossing.

Fig 5

Applications of planar Graphs:


 Planarity of graphs plays an important role in the design of electronic
circuits. We can model a circuit with a graph by representing components
of the circuit by vertices and connections between them by edges.
 We can print a circuit on a single board with no connections crossing if the
graph representing the circuit is planar. When this graph is not planar, we
must turn to more expensive options
 The planarity of graphs is also useful in the design of road networks.

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.

For example:

A connected planar simple graph has 20 vertices, each of degree 3. We can find
regions using Euler’s Formula. Since, there are 20 vertices, each of degree 3, so
v = 20. Because the sum of the degrees of the vertices, 3v = 3·20 = 60, is equal to
twice the number of edges, 2e, we have 2 e = 60, or e = 30.

Thus, the number of regions is r = e−v+2 = 30−20+2 = 12.


COROLLARY 1:

If G is a connected planar simple graph with e edges and v vertices, where v ≥ 3,


then e ≤ 3v−6.

COROLLARY 2:

If G is a connected planar simple graph, then G has a vertex of degree not


exceeding five.

COROLLARY 3:

If a connected planar simple graph has e edges and v vertices with v ≥ 3 and no
circuits of length three, then e ≤ 2v−4.

For example:

Fig 6

Because K3, 3 has no circuits of length three, corollary 3 can be used. K 3, 3 has six
vertices and nine edges. Because e = 9 and 2v−4 = 8, Corollary 3 shows that K 3, 3
is non planar

You might also like