Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
33 views1 page

5.9. Planar Graph

A graph is planar if it can be drawn without edge crossings, and it can be represented in a way that divides the plane into regions. Euler's formula relates the number of regions, vertices, and edges in a connected planar graph. Planarity is crucial in applications like electronic circuit design and road network planning, where non-planar graphs may require more complex solutions.

Uploaded by

merix017
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
33 views1 page

5.9. Planar Graph

A graph is planar if it can be drawn without edge crossings, and it can be represented in a way that divides the plane into regions. Euler's formula relates the number of regions, vertices, and edges in a connected planar graph. Planarity is crucial in applications like electronic circuit design and road network planning, where non-planar graphs may require more complex solutions.

Uploaded by

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

Discrete Structures

5.9. 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.
We can show that a graph is planar by displaying a planar representation. It is harder to show
that a graph is nonplanar.
A planar representation of a graph splits the plane into regions, including an unboubded
region.
L. 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 graph.
Euler‘s formula. Let G be a connected planar simple graph with n vertices and m edges. Let
r be the number of regions in a planar representation of G. Then 𝑟 = 𝑚 − 𝑛 + 2.
Theorem. Neither 𝐾 nor 𝐾 , is planar.
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. For example, we can partition the vertices in the graph representing the circuit
into planar subgraphs. We then construct the circuit using multiple layers.
The planarity of graphs is also useful in the design of road networks. Suppose we want to
connect a group os cities by roads. We can model a road network connecting these cities using a
simple graph with 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.

29

You might also like