K. Maheswaran MCA, M.Phil., M.SC, (Maths), SET, PH.D

K. Maheswaran MCA, M.Phil., M.Sc, (Maths), SET, Ph.
D
Assistant Professor in Computer Science
School of Computing Sciences
St.Joseph’s College(Autonomous)
Tiruchirappalli- 620 002
Compiled by Prof.K.Maheswaran
theory
MCA, MPhil,MSc(Maths),SET
2
Graph theory
3
.v 6 v
GRAPH THEORY
DEFINITIONS
 Self loop
 Parallel edges
 Incident
 Adjacent
 Degree of the vertex
 Regular graph
 Simple graph
 Null graph
 Isolated graph
 Pendent vertex
 Serial edges
4
DEFINITIONS
 Self loop
 Adjacent
 Serial edges
 Parallel edges
 Degree of the vertex
 Regular graph
 Simple graph
 Null graph
 Isolated graph
 Pendent vertex
 Incident
5
Basic Definitions of Graph Theory
Self Loop:
An edge having both of its end vertices are same, such
a edge is called “Self Loop”.
Adjacent:
 Two Non-Parallel are said to be adjacent if they are
incident on a common vertex.
 Two vertices are said to be adjacent if their end vertices
are same edge.
Serial Edges:
Two adjacent edges are said to be serial if there is a common
vertex of degree 2. 6
Parallel Edges:
Two edges are said to be parallel if their end vertices are
same
Degree of the vertex:
The number of edges incident on a vertex v is called the
degree of the vertex.(Here self loop is counted twice). It is
usually denoted by d(v).
Regular Graph:
A Graph in which all vertices are equal degree is known as
Regular Graph.
Simple Graph:
A graph that has been neither self loop nor parallel edges are 7
called Simple Graph:

Null Graph:
Every vertex in a null graph is Isolated vertex.
Isolated vertex:
The vertex with degree zero is called “Isolated
vertex”.
Pendant vertex:
The vertex with degree one is called “Pendant
vertex”.
Incident:
When a vertex Vi is an end vertex of some edge (ej)
then Vi and ej are said to be incident . 8
9
RESULT:

10
11
ISOMORPHIC
12
ISOMORPHIC
13
IS IT ISOMORPHIC?
14
15
SUB GRAPHS
16
OBSERVATIONS
17
WALK
TERMINAL VERTICES
In a walk beginning and end vertices are called “Terminal
Vertices”.
 Closed walk:
A walk is an Closed walk in which Starting and end vertices

are same.
 Open Walk
 A walk is an Openwalk in which Starting and end vertices are
different.
18
Path:
- Self loop is allowed in a walk but not path.
Circuit
- A circuit is a closed walk in which no vertex appears
more than once. (except initial and end vertex)
- Circuit is also referred as ‘cycle’ .
Length of the Path:
The number of edges in a path is called Length of the
Path
19
CONNECTED GRAPH:
DISCONNECTED GRAPH:
A Graph G is said to be disconnected graph if there is no
path b/w at least two vertices
COMPONENT:
20
EULER GRAPHS
 Euler line:
A closed walk running through every edge of G

exactly once. Such a walk is called “Euler line”.
 Euler graph:
 A graph that consist of an Euler line is called “Euler
graph”.
Note :
 Euler graph do not have any isolated vertices.
21
 Euler graph is always connected.
KONIGBERG BRIDGE
(BEST EXAMPLE OF GRAPH THEORY)
 It’ s
a long standing problem solved by
Leonhard Euler in 1736
22
Euler represents this situation by using graph as shown in the
figure.
23
The vertices represents the land areas and edges represents
the bridges. Here we find that nor all it’s vertices of even
degree and hence it’s not an Euler graph. Thus, it is not
possible to walk over each bridge exactly once and return to
the starting point.
This problem is an same as the problem of drawing
figure without lifting the pen from the paper and 24
without retracing the line.
UNICURSAL LINE
 An open walk covering all the edges without
retracing any edge(exactly once) is known as
“Unicursal line”.(open Euler line)
 A graph that has a unicursal line will be called
“Unicursal graph”.
Unicursal line 
25
Note :
 By adding an edge b/w the initial
and final vertices of a unicursal line we
will get a EULER LINE.
 Thus a connected graph is
unicursal iff exactly two vertices of odd
degree.
26
OPERATIONS ON A GRAPH
1. UNION
2. INTERSECTION
3. RING SUM
4. DECOMPOSITION
5. DELETION
6. FUSION
27
UNION OF TWO GRAPHS.
G1= (V1,E1) and G2=(V2, E2)
If G3 = (V3, E3) Where V3 = V1 U V2 and E
3 = E1 U E2
Then G3 = G1 U G2
28
INTERSECTION OF TWO GRAPHS
G1= (V1,E1) and G2=(V2, E2)
If G3 = (V3, E3) Where V3 = V1 ∩ V2 and E
3 = E 1 ∩ E2
Then G3 = G1 ∩ G2
29
30
RING SUM
31
DECOMPOSITION
32
DELETION
33
FUSION:
NOTE:
 Union , Intersection and Ring sum are Commutative.
i.e G1 U G2 = G2 U G1
G1 G2 = G2 G1
 if G1 and G2 are edge disjoint, then
I. G1 ∩ G2 is null graph.
II. G1 G 2 = G 1 U G 2
34
ARBITRARILY TRACEABLE GRAPH FROM VERTEX ‘V’
 In a Euler graph if there is a vertex v such that we can

trace the Euler line, simply by moving along any edge
that has not already been traversed, then the graph is
said to be “Arbitrarily traceable graph from v ”.
 Given fig. is an Euler graph. Suppose we start vertex ‘a’

and trace the path a b c now at c we have the choice of
going to a, d ,or e.
35
ARBITRARILY TRACEABLE GRAPH FROM VERTEX ‘V’ (CONTD…..)
 If you took choice ‘a’ we can trace only circuit a

b c a which is not an Euler line. But starting
from c, we can trace the Euler line, simply by
moving along any edge that has not already been
traversed.
36
Note:
• An Euler graph G arbitrarily traceable from vertex ‘v’ in G Iff
every circuit in G Contains ‘v’
37
• Hamiltonian circuit in a connected graph G is
defined as a closed walk that traverses every vertex
of G exactly once, except the starting vertex at
which the walk terminates.
Definition:( Hamiltonian Circuit)
Compiled by Prof.K.Maheswaran MCA,

38
MPhil,MSc(Maths),SET
39
1. Hamiltonian Circuits in a graph of n –vertices
consist of exactly n- edges.
2. Not every connected graph has a Hamiltonian
Circuit.
3. There is no criterion, we can apply to determine
the existence of a hamiltonial circuit in general.

40
• A path is Connected graph G is said to be
Hamiltonian if it includes every vertex of G.
• If we remove any one edge from Hamiltonian
circuit, we are left with a path. This path is called
“Hamiltonian Path”.
Note:
1) Every graph that has a Hamiltonian circuit also
has a Hamiltonian path, since Hamiltonian path is
a sub graph of Hamiltonian circuit.
2) Not graph with Hamiltonian path has Hamiltonian
Circuit.
3) The Length of a Hamiltonian path in a connected
graph of a vertices is n-1.
41
COMPLETE GRAPH

42
Note:
1. If a Complete graph G consists of n vertices, then

degree of every vertex is n-1, since every vertex is
joined with every other vertex through one edge.
2. Total no. of edges in G is
3. Every complete graph having more than 2 vertices

have Hamiltonian Circuit.

43
44
45
This

46
47
48

K. Maheswaran MCA, M.Phil., M.SC, (Maths), SET, PH.D

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

K. Maheswaran MCA, M.Phil., M.SC, (Maths), SET, PH.D

Uploaded by

Copyright:

Available Formats

K. Maheswaran MCA, M.Phil., M.Sc, (Maths), SET, Ph.

Degree of the vertex:

called Simple Graph:

- Self loop is allowed in a walk but not path.

exactly once. Such a walk is called “Euler line”.

G1= (V1,E1) and G2=(V2, E2)

G1= (V1,E1) and G2=(V2, E2)

 In a Euler graph if there is a vertex v such that we can

 Given fig. is an Euler graph. Suppose we start vertex ‘a’

 If you took choice ‘a’ we can trace only circuit a

Definition:( Hamiltonian Circuit)

Compiled by Prof.K.Maheswaran MCA,

Compiled by Prof.K.Maheswaran MCA,

Compiled by Prof.K.Maheswaran MCA,

1. If a Complete graph G consists of n vertices, then

2. Total no. of edges in G is

3. Every complete graph having more than 2 vertices

Compiled by Prof.K.Maheswaran MCA,

Compiled by Prof.K.Maheswaran MCA,

You might also like