HAMILTONIGRAPHL

Def A Path cycle in a graph containing all its

Vertices is called a HAMILTON PATH respt HAMILTON

CYCLE

A graph is called Hamiltonian if it contains a

Hamilton cycle

Example

EI EI NOT Hamiltonian
Ce ab d ca is a

Hamiton cycle But Ga has a

Hamilton Path
9 is Hamiltonian
D a b d c e
 Interesting Questions

Find necessary and sufficient conditions for a

graph to be Hamilton

Design a Polynomial time algorithm to check whether

a given graph has Hamiton cycle or not

 In this chapter we restrict our attention to

Simple graphs because loops and multiple edges

are irrelevant

We can see that

A graph is Hamiltonian if and only if the

simple graph obtained by keeping one copy of each

non loop edge is Hamiltonian

 Necessary
theorem Hamiltonian graph is 2 connected

Proof In a Hamiltonian graph there is a

cycle containing all Vertices when you remove one

Veeten from this cycle the resulting graph contains

a Path with all the remaining vertices

O the Hamiltonian graph is 2 connected

Does thee above condition 2 Connectedness is

sufficient a b
ExamPI
Ang No d
E C

g f
The above graph is 2 connected but there

is No Hamiltonian cycle
 Petersen graph
Examiner

2 connected but NO Hamiltonian cycle

Boy N 10
m 15

G
G does not have a cycles of length 3 or 4
Assume that there is a Hamiltonian cycle E in G

C contains 10 edges Then there are five

more edges in G

However the
way we add these five edges

we create a 3 or 4 cycle which is a

contraction as the graph no 3 ur 4 cycles

Theorem
Neary conditions

If Gis Hamiltonian then c G 5 51 5 VCE

where CCG S denotes the number of components in

G S

S
it

00
G 5

Let C be a Hamitonian Cycle in G

let SEVIG and 151 k

FEELCI with one end in S another end G5

Every veeter of G is incident with Two edges of C

Every veeter of S is incident with at most

two edges of F
 i IF I E 2k worst case

On the otherhand every component of G S is

incident with at least two edges of F
IFI 32 G S

From 820

2 G S E IFI E 2K

G S Sk IS

CCG.IO
Again this condition is Not sufficient

Example Petersen graph

This graph satisfies G S 51st forall SE VIG

But it is not Hamiltonian
 Divac 1959 Sufficient
Theory Let G be a graph of order n73

If 8167712 then G is Hamiltonian

Prof

iEEÉ
Let G be a graph with 8167212

Let P U Up is be a Path of maximum

length in G

As P is a maximum length Path all of the

neighbors of U and Up are on P

Since 816722 each of 0 and Up has at least

I neighbors on P

Claim Fj is j sp such that

UjEN up
and Uja EN Ui
on P
Suppose not then for every neighbor Ui ofUp
Viti is not a neighbor of vi

deg O E R1 ng En 2 2
which is a contradiction to the fact that 867272
Such a j exists

Let c be the Cycle Oi Oz Oj Op Opl Viti Q

claim C is a Hamiton sale of G

Suppose not ie F one vertex of G that

is not on P

Since SCG then G is connected

I
i There must be a vertex w not on P that is
adjacent to Some Ui of P

iEEÉ
The the Path in G that begins at W travels to Ui and

then travels around the cycle is a longer Path than our

maximal Path P which is contradiction Gis Hamiltonian

xx

In the above theorem we showed that the Condition

8167 Mz is Sufficient But is it Necessary

AI No

For example take any cycle Say Cg

81687 2 But CS is Hamiltonian
 What happens if we replace 81977,12 1
instead of 8191712 in the above theorem

Anf G may not be Hamiltonian Some Cases

complete bipartitegraph
Examft

vertices vertices
ng
It is easy to that But the graph
see a
MI
is Non Hamiltonian
Kya UI
EI 00 scans E
It has a cut veeted So not Hamitonian

Lore'stheorem
Theorems Let G be a graph of order n 73

If degalt degly In f for all Pair of nonadjacent

vertices x y then G is Hamiltonian

Boot Exercise
 A
ki
claw graph 21

Def Given graphs G and H if G does not contain a

copy of It as an induced subgraph then we say that

G is H free

Theorems
If G is a 2 Connected King 2 free graph

then G is Hamiltonian

Bf's let C be a longest cycle in G

If is not Hamiltonian cycle then UEVCG

and V C Suppose 0 is adjacent to a vertex

W on C a

het adb be the neighbors

b
f
of W on C
 if all EE a or bee ECG then longer cycleexists

avaecal a bucteca

If ab Eca then Will aib is Ki

and we know that G is KiB free

114
so it must be Abe ECG then Will a b is 2

contradiction

Therefore it must be that C is a Hamiltoniancycle

 Tournament Graph

A tournament is a directed graph that

represents a round robin tournament where

every Pair of Vertices has a directed edge

between them

Example Suppose we have 3 teams A B C

if A beats B B beats C and C beats A

the tournament graph would be

1
 Now in the graph G consider the possible orientations

of the edges incident to U

DI EEC then Uk
Cast If U U Uz
is Hamiltonian Path in G
Casf If Uhl EEG then UI V2 Okie

is Hamiltonian Path in G
do hold
Cash suppose case I 4 I not

ii it
PK

Look at the edges incident to U in the order U to UK

There must be some point where the edges switch from

Pointing towards u from Pointing away

from D

ie Fi Is isnt for which 4 VEER

UViHEECa
 Then V1 V2 Vi D Vit On is a Hamiltonian

Path in G

Tournament Isomorphism is an unsolved problem

ie Given Two tournaments T To check whether

T is isomorphic to T2
NOT known to be in P
or NP complete
 Which Tournaments have Hamiltonian cycle

Theorem A Tournament has a Hamiltonian cycle

if and only if it is Strongly connected

Proof Proof of One direction is easy

Suppose T is strongly connected we show that

T has a Hamiltonian cycle

Claims T has a cycle C

consider a directed edge UV Since T is

strongly connected there is a path from 0 to U

The Path together with the edge UV too

forms a cycle

If the length of longest cycle l is n then we

are done Suppose Ian

W DEVIC Vue ECC for some UEC

L DEVIC UV ECG for some UEC

C
Cased If W D 1 0
then c contains all ratios of Éf
I
v

Casey W G and L 0

uf fu
C has no incoming edges

if UEL DEC then there

is NO directed Path from A to V which is a

contradiction to the fact that T is strongly connected

Casey WHA L D het UEC NEW

Similar to the Case 2 No directed Path from U too

Again we get a contradiction

f
c wnL
easy what
If UE Wn L then we can insert a btw two
 consecutive vertices of C so we get a cycle of

length more than I which is a contradiction

cased W 0 Ltd and NML P

Since T is strongly connected there
Ñ
must be a directed edge use for ÉL
Some UEL DEW Then the vertices were can be

inserted in the cycle C to get cycle of length 1

again a
contradicting our assumption the length of

the longest cycle is l

xx
 Def King Latex
A Vertex U in a directed graph is called a

king if for every other vertex U there exists

a directed Path of length at most 2 from

V to U

iffy
Example In this enamite

Vertex a is a

d
king