Quantitative Graph Theory.

Topic-Planar Graph.

Presented by- Bivek Mazumder(23) .

Ujjal Protim Dutta(7).
MCA 2nd Semester.
Contents:
 Introduction
 Kuratowski's Theorem
 Euler’s Formula
 Average Degree
 Planar graph density
 Maximal planar graph
 Outer planar graph
 Applications
 Pythagorean Fuzzy Planar Graphs
 C program to find the number of region in a
planar graph:
Introduction:

Introduction:
 In graph theory, a planar graph is a graph that can
be embedded in the plane, i.e., it can be drawn on the
plane in such a way that its edges intersect only at
their endpoints.

 In other words, it can be drawn in such a way that no

edges cross each other.

 Such a drawing is called a plane graph or planar

embedding of the graph. 

 A plane graph can be defined as a planar graph with

a mapping from every node to a point on a plane, and
from every edge to a plane curve on that plane, such
that the extreme points of each curve are the points
Kuratowski's Theorem:
 The Polish mathematician Kazimierz Kuratowski provided a
characterization of planar graphs in terms of forbidden graphs, now known
as Kuratowski's theorem:

 A finite graph is planar if and only if it does not contain a subgraph that
is a subdivision of the complete graph K5 or the complete bipartite graph
 K3,3 (utility graph).

An example of a graph with no K5 or K3,3 subgraph . However, it

contains a subdivision of K3,3 and is therefore non-planar.

A subdivision of a graph results from inserting vertices into edges (for

example, changing an edge •——• to •—•—•) zero or more times.
Euler’s Formula:

 Euler's formula states that if a finite, connected, planar graph

is drawn in the plane without any edge intersections, and n is the
number of vertices, e is the number of edges and r is the number
of faces (regions bounded by edges, including the outer, infinitely
large region), then number of regions..

 r=e-n+2.

The Euler’s formula can be proved by using induction.

If e = 0 then G must have just one vertex.
i.e., n = 1 and one infinite region, i.e., r = 1
Then n – e + r = 1 – 0 + 1 = 2.
•If e = 1 (though it is not necessary), then the number of vertices of G is
either 1 or 2, the first
possibility of occurring when the edge is a loop. In this case also we can
show that n – e + r .
Proof:
We add one new edge K to G to form a connected supergraph of G
which is denoted by G + K.
There are following three possibilities.
(i) K is a loop, in which case a new region bounded by the loop is
created but the number of
vertices remains unchanged.
(ii) K joins two distinct vertices of G, in which case one of the region
of G is split into two, so
that number of regions is increased by 1, but the number of vertices
Ifremains
let n′, e′unchanged.
and r′ denote the number of vertices, edges and regions in
G(iii)
and n, incident
K is e and r denote theone vertex of G on which case another
with only
same
vertexinmust
G + K.beThen
added,
In case (i) nthe
increasing – e number
+ r = n′ of
– (e′ + 1) +by
vertices (r′one,
+ 1)but
= n′ – e′ + the
leaving r′. number of
In case (ii)
regions n – e + r = n′ – (e′ + 1) + (r′ + 1) = n′ – e′ + r′
unchanged
In case (iii) n – e + r = (n′ + 1) – (e′ + 1) + r′ = n′ – e′ + r′.
But by our induction hypothesis, n′ – e′ + r′ = 2.
Thus in each case n – e + r = 2 .
Now any plane connected graph with e edges is of the form G + K,
for some connected graph G
with e – 1 edges and a new edge K
 Average Degree:
Connected planar graphs with more than one edge
obey the inequality 2e≥3f , because each face has
at least three face-edge incidences and each edge
contributes exactly two incidences. It follows via
algebraic transformations of this inequality with Euler's
formula v- e + f = 2 that for finite planar graphs
the average degree is strictly less than 6. Graphs with
higher average degree cannot be planar.
Planar graph density:

The density D of a planar graph, or network, is defined as a ratio

of the number of edges E to the number of possible edges in a
network with N nodes, given by a planar graph Emax = 3N –
6, D= E-N+1/2N-5.A completely sparse planar
giving 
graph has D=0,alternatively a completely dense planar graph
has D=1
Maximal planar graph:
 A simple graph is called maximal planar if it is planar but adding any
edge (on the given vertex set) would destroy that property.

All faces (including the outer one) are then bounded by three edges,
explaining the alternative term plane triangulation.

 The alternative names "triangular graph “ or “ triangulated graph" have

also been used, but are ambiguous, as they more commonly refer to the 
line graph of a complete graph and to the chordal graphs respectively.
Every maximal planar is 3-vertex-connected.

If a maximal planar graph has v vertices with v > 2, then it has precisely

3v − 6 edges and 2v − 4 faces.

The Goldner – Harary graph is maximal planar. All

its faces are bounded by three edges.
 In a maximal planar graph (or more generally a polyhedral
graph) the peripheral cycles are the faces, so maximal planar
graphs are strangulated.

The strangulated graphs include also the chordal graphs, and

are exactly the graphs that can be formed by clique-sums (without
deleting edges) of complete graphs and maximal planar graphs.
Outer planar graph:
A planar graph is said to be outer planar if i(G) = 0. For example,
cycles, trees, K4 – x.
Maximal outer planar graph
An outer planar graph G is maximal outer planar if no edge can be
added without losing outer
planarity . For example,

 Minimally non-outer planar graphs

A planar graph G is said to be minimally non outer planar if i(G) = 1
.for example..
Applications:
In modern era, the applications of planar graphs
occur naturally
Designing such as: complex radio electronic circuits
and structuring

 Railway maps

 Planetary gearbox

Chemical molecules

While modeling an urban city:

Pipelines

 railway lines

subway tunnels

electric transmission lines and

metro lines
Planar graph related to real life:
From the power plants to our houses, the potent power lines
that are zigzagging our countryside or city streets carry
numerously high voltage electricity. For reducing such high
voltage electricity to lower voltage, an equipment is used,
called a transformer. A transformer works in a very simple
way, consisting of different units in which electric current
flows through tiny wires. While connecting the units with each
other, crossing between tiny wires may occur. Sometimes,
crossing between wires is beneficial as it helps in utilizing less
space and makes it inexpensive, but, on the other hand, due
to crossing, the transformer heats up and there is a chance of
an explosion that is quite dangerous for human life. To
overcome this problem, a crossing between such wires needs
to be minimized or good quality wires are needed for
installation. The practical approach of Pythagorean fuzzy
planar graphs can be utilized to structure this kind of situation
for reducing the rate of destruction.
Consider an electric transformer in which units are connected as shown in 
Figure below. Each unit U1,U2,…,U7 is represented by a vertex and each electric
connection between units through tiny wire is represented by an edge. The membership
grade of the vertex depicted the chances of electric spark, whereas the non-membership
grade interpreted the chances of no electric spark in the unit. The membership grade of
the edge depicted the intensity of electrical hazard between two units, whereas the non-
membership grade interpreted no intensity of electrical hazard.

Transformer units connection.

As the number of crossings increase, the rate of destruction increases.
Hence, the measurement of the planarity value is necessary. There are
six crossings C1, C2, C3, C4, C5 and C6 between the pair of wires (U4
U6,U2 U5), (U3 U6,U2 U5), (U2 U5,U1 U3), (U2 U6,U1 U3), (U2 U7,U1
U3) and 
(U2 U7,U1 U6), respectively. The strength of the wire U4
U6=(0.9,0.95), U2 U5=(0.5,0.85), 
U3 U6=(0.67,0.78), U1 U3=(0.9,0.94), U2 U6=(1,0.91), U2
U7=(1,0.93) and U1 U6=(0.93,1).
For crossings, the point of intersections
are  SC1=(0.7,0.9),
 SC2=(0.59,0.82), SC3=(0.7,0.9), SC4=(0.95,0.93), SC5=(0.95,0.94) and 
SC6=(0.97,0.97). Thus, Pythagorean fuzzy planarity
value F=(0.17,0.15). Since the planarity value is at a minimum, it
indicates the possibility of high destruction. To reduce crossing, we can
change the graphical representation as shown in Figure below.

Pythagorean fuzzy electric connection model.

 We know that the number of intersecting points is inversely
proportional to planarity. Since the number of intersecting points
decrease, the Pythagorean fuzzy planarity
value F=(0.63,0.55) increases and rate of destruction
decreases. 
ythagorean Fuzzy Planar Graphs:
In planar graph, the intersection between edges is not
acceptable. However, in this section, we determine a
Pythagorean fuzzy planar graph in an interesting manner with a
parameter called ‘Pythagorean fuzzy Planarity’. Planarity is an
amount that measures how much a graph is planar. It is very
useful in connecting different networking models, structuring
websites containing many pages, designing electronic chip, etc.
Sometimes, crossing between edges can not be avoided so for
this purpose we only consider minimum number of crossing.
Hence, Pythagorean fuzzy planar graphs are important for these
kinds of connections.
C program to find the number of region in a
planar graph:

// C implementation of the approach

#include <stdio.h>
main()
{
int v , e , r;
printf ("\n enter value for v:");
scanf ("%d", &v);
printf ("\n enter value for e:");
scanf ("%d", &e);
r=e+2-v;
printf ("\n R=%d", r);

}
Thank you