TECHNICAL PRESENTATION

ON

HAMILTONIAN
CIRCUIT

Presented By :
ABHISHEK KUMAR SINGH
3RD -07RWSCA001
 Outline
 Introduction
 Definition

 Example

 Real life applications

 Discussion
 Introduction
 Hamiltonian path is a path in an
undirected graph which visits each
vertex exactly once. A Hamiltonian
cycle (or Hamiltonian circuit) is a
cycle in an undirected graph which
visits each vertex exactly once and
also returns to the starting vertex.
Determining whether such paths and
cycles exist in graphs is the
Hamiltonian path problem
 Paths and Circuits
 A walk in a graph is an alternating
sequence of adjacent vertices and edges.

 A path is a walk that does not contain a

repeated edge.

 A circuit is a closed walk that does not

contain a repeated edge.

 A simple circuit is a circuit which does not

have a repeated vertex except for the first
and last.
 A Hamilton path is a path that goes
through each vertex of the graph
once and only once.

 F, A, B, E, C, G, D is
a
 Hamilton path
 A Hamilton circuit is a circuit that
goes through each vertex of the
graph once and only once (starting
point and ending point is the same)

F, B, E, C, G, D, A, F is a
Hamilton circuit
 A complete graph with N vertices is a
graph in which every pair of distinct
vertices is joined by an edge. Symbol
is KN
 KN has N(N-1) / 2 edges
 The number of Hamilton circuits in KN is
(N-1)!
 Example
This complete graph has 4 vertices so there are
(4-1)! = 3! = 3·2 ·1= 6 Hamilton circuit

Let A be the reference point:

A, B, C, D, A
A, B, D, C, A
A, C, B, D, A
A, C, D, B, A A B
A, D, B, C, A
A, D, C, B, A

D C
 Example

Graph of the tetrahedron with Graph of the cube with a

a Hamiltonian circuit Hamiltonian circuit
 Real life applications:
Anything where you have to visit all locations,

such as :-

pizza delivery
mail delivery
traveling salesman
garbage pickup
reading gas meters
Any Question on???
THANK
YOU