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

Scribd
Upload
18 views15 pages

Mod3 Part4

The document discusses the concepts of isomorphism and planarity in graphs, defining isomorphic graphs as those with a one-to-one correspondence between their edges and vertices while preserving incidence relationships. It also explains planar graphs, which can be drawn on a plane without edge crossings, and introduces Kuratowski's two non-planar graphs (K5 and K3,3) as examples. Additionally, it mentions Euler's formula for counting regions in connected planar graphs.

Uploaded by

karthikpm0412
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
18 views15 pages

Mod3 Part4

The document discusses the concepts of isomorphism and planarity in graphs, defining isomorphic graphs as those with a one-to-one correspondence between their edges and vertices while preserving incidence relationships. It also explains planar graphs, which can be drawn on a plane without edge crossings, and introduces Kuratowski's two non-planar graphs (K5 and K3,3) as examples. Additionally, it mentions Euler's formula for counting regions in connected planar graphs.

Uploaded by

karthikpm0412
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/ 15

ISOMORPHISM

1
ISOMORPHISM
 Two graphs are said to be isomorphic (equivalent) if they
have identical behavior in terms of graphic theoretic
properties
 Two graphs G and G1 are said to be isomorphic if there is
a one to one correspondence between their edges and
vertices such that the incidence relationship is preserved.
 Two isomorphic graphs must have
1. The same number of vertices
2. The same number of edges
3. An equal number of vertices with a given degree.
4. The incidence relationship must be preserved.

2
ISOMORPHISM

3
ISOMORPHIC GRAPHS OR NOT?

4
PLANAR GRAPHS
 A graph G 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 graphthat cannot be drawn on a plane with out a cross over


between its edges is called non-planar.

 A drawing of a geometric representation of a graph on any surface such


that no edges intersect is called embedding.
 To declare a graph G is non-planar , we have to show that of all
possible geometric representations of G none can be embedded in a
plane.

 An embedding of a planar graph G on a plane is called a plane 5


representation of G.
DRAWINGS IN THE PLAN

 Can a graph be drawn in a plane without edge


crossings?
7
KURATOWSKI’S TWO GRAPHS
 The complete graph of five vertices (K5) is non-planar.
Proof:

8
 Kuratowski’s second graph ( K3,3 )is also non-
planar.
 A regular connected graph with 6 vertices and 9 edges .

or

9
PROPERTIES OF KURATOWSKI’S TWO GRAPHS

1. Both are regular graphs


2. Both are non-planar
3. Removal of one edge or a vertex makes each a
planar graph
4. Kuratowski’s first graph is the non-planar graph
with the smallest number of vertices, and
Kuratowski’s second graph is the non-planar
graph with smallest number of edges. Thus
both are the simplest nonplanar graphs.

10
Terminologies

A plane representation of graph divides the plane into regions


called faces .
Note: the outside area of a graph also counts as a region.
2 Types of regions.
Finite region
 The area bounded by a subset of the vertices and edges of a
graph.
Infinite region
 The portion of a plane lying outside a graph embedded in a
plane is called infinite region (outer or exterior region)
11
COUNT NO.OF REGIONS

5
1
2 4

3
6

12
COUNT NO.OF REGIONS

5
1
2 4

3
6

13
EULER’S FORMULA

A connected planar graph with n vertices and e edges


has e - n+2 regions.
ie,
No.of regions r = e – n + 2

14
EXAMPLES OF COUNTING REGIONS

15

You might also like