Scribd
Upload
39 views14 pages

Planar Graphs

a presentation on planar graphs

Uploaded by

d8652763
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
39 views14 pages

Planar Graphs

a presentation on planar graphs

Uploaded by

d8652763
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/ 14

Planar Graphs

▪ A graph G (V,E) is said to be planar if there exists some geometric representation of G


which can be drawn on a plane such that no two of its edges intersect.
▪ A graph that cannot be drawn on a plane without a crossover between its edges is
called nonplanar.
▪ A drawing of a geometric representation of a graph on any surface such that no edges
intersect is called embedding.
▪ For a graph G to be nonplanar, we have to show that of all possible geometric
representations of G none can be embedded in a plane.
▪ A geometric graph G is planar if there exists a graph isomorphic to G that is embedded
in a plane.
▪ An embedding of a planar graph G on a plane is called a plane representation of G.
Planar Graphs

▪ The geometric representation shown in the above figure clearly is not embedded in a
plane, because the edges e and f are intersecting.
▪ Redraw edge f outside the quadrilateral (extending it outward), leaving the other
edges unchanged, we have embedded the new geometric graph in the plane, thus
showing that the graph is planar.
▪ Let us consider another example - the two isomorphic diagrams shown in the
following figure are different geometric representations of one and the same graph.
One of the diagrams is a plane representation; the other one is not. The graph, of
course, is planar.
Planar Graphs

▪ In another example, we see that it is not possible to draw any of the three configurations
on a plane without edges intersecting. The reason is that the graph which these three
different diagrams is non-planar.
DIFFERENT REPRESENTATIONS OF A PLANAR
GRAPH
▪ Region: A plane representation of a graph divides the plane into regions (also called
windows, faces, or meshes), as shown in the following figure. A region is characterized by
the set of edges (or the set of vertices) forming its boundary.

▪ The above graph is a planar representation of the shown graph:


DIFFERENT REPRESENTATIONS OF A PLANAR
GRAPH
▪ It is to be noted that a region is not defined in a nonplanar graph or even in a planar
graph not embedded in a plane.
▪ In the following graph, there are no regions. Thus a region is a property of the specific
plane representation of a graph and not of an abstract graph per se.

▪ Infinite Region: The portion of the plane lying outside a graph embedded in a plane,
such as region 4 in the previous graph, is infinite in its extent. Such a region is called
the infinite, unbounded, outer, or exterior region for that particular plane
representation. Like other regions, the infinite region is also characterized by a set of
edges (or vertices).
DIFFERENT REPRESENTATIONS OF A PLANAR
GRAPH

▪ A planar graph may be embedded in a plane such that any specified region (i.e.,
specified by the edges forming it) can be made the infinite region.

▪ A connected planar graph with n vertices and e edges has e − n + 2 regions.


DETECTION OF PLANARITY
▪ How to determine whether a graph is planar or not.
▪ The following steps will help to find that out.
Step - 1
❑ Since a disconnected graph is planar if and only if each of its components is planar,
we need consider only one component at a time. Also, a separable graph
(vertex-connectivity is one) is planar if and only if each of its blocks is planar.
Therefore, for the given arbitrary graph G, determine the set
G = {G1 , G2 , . . . , Gk}, where each Gi is a non-separable block of
G. Then we have to test each Gi for planarity.
Step - 2
❑ Since addition or removal of self-loops does not affect planarity, remove all self-loops.
Step – 3
❑ Since parallel edges also do not affect planarity, eliminate edges in parallel by
removing all but one edge between every pair of vertices
DETECTION OF PLANARITY
Step - 4
❑ Elimination of a vertex of degree two by merging two edges in series† does not affect
planarity. Therefore, eliminate all edges in series.

❑ Repeated application of step-3 and step-4 will reduce the graph drastically.

Let us consider a graph given by


DETECTION OF PLANARITY
The following figure illustrates the series-parallel reduction of the graph shown in the
previous slide

The final graph that we see here is just a single edge.


DETECTION OF PLANARITY
The following theorem helps to determine the planarity

The final reduced graph should be either


1) A single edge or
2) A complete graph with four vertices or
3) A non-separable, simple graph with n ≥ 5 and e ≥ 7.

If 1) or 2) satisfies, then the graph is planar and no need to check further.


If 3) is not satisfied, then the graph is non-planar and if it is satisfied then also there is a
possibility that it can be non-planar also.

Homeomorphic Graphs: Two graphs are said to be homeomorphic if one graph can be
obtained from the other by the creation of edges in series (i.e., by insertion of vertices of
degree two) or by the merger of edges in series.
DETECTION OF PLANARITY
Homeomorphic Graphs: Two graphs are said to be homeomorphic if one graph can be
obtained from the other by the creation of edges in series (i.e., by insertion of vertices of
degree two) or by the merger of edges in series.

Property:
A graph G is planar if and only if every graph that is homeomorphic to G is planar.
DUAL GRAPHS
▪ Consider the plane representation of a graph in the following figure, with six regions
or faces F1 , F2 , F3 , F4 , F5 , and F6 .
▪ Let us place six points p1 , p2 , . . . , p6 , one in each of the regions, as shown in the
figure.
▪ Next let us join these six points according to the following procedure:
• If two regions Fi and Fj are adjacent (i.e., have a common edge), draw a line joining
points pi and pj that intersects the common edge between Fi and Fj exactly once.
• If there is more than one edge common between Fi and Fj , draw one line between
points pi and pj for each of the common edges.
• For an edge e lying entirely in one region, say Fk , draw a self-loop at point pk
intersecting e exactly once.
• By this procedure we obtain a new graph which is the dual of the original graph.
• Clearly, there is a one-to-one correspondence between the edges of graph G and its
dual.
DUAL GRAPHS
DUAL GRAPHS
Some simple observations that can be made about the relationship between a planar
graph G and its dual
▪ An edge forming a self-loop in G yields a pendant edge in its dual.
▪ A pendant edge in G yields a self-loop in dual.
▪ Edges that are in series in G produce parallel edges in its dual.
▪ Parallel edges in G produce edges in series in its dual.
▪ The number of edges, vertices, regions of a graph G and its dual are always equal.

You might also like