ORE'S THEOREM

vertices n (23) and if

If Gis a simple graph of

deg (u) + deg (v) 2n ... (1)

Tor every pair of non-adjacent vertices uand v, then G 1S

Hamiltonian.
Proof : We shall prove the theorem by contradiction. We assume
that there exists a non-Hamiltonian graph with n vertices satisfying the
 Graphs
and Graph models
condition () for every pair of 3 103
ven non- adjacent
Among all such non Hamilonian
with maximum number ofgraphs,
let G be averlices u and v
graph
non. Hanniltonian, it follow that thereedges.
exist
non-Hamiltonian
Because Gis maximal
Hen in a
in Gsuch that addition of an
Hamiltonian graph. Thus in
cdge
G, there is a
two non-
joining u
adjacenty vertices
and will result
ber = ll|, W2, W3, , lln v with u
and v as
Hamiltonian path.
the end
shown in figure. vertices as

n V.

acly Uj-1 Uj+1

1Ces

Define
ot
S = :u; is adjacent to vertex u in
G}
T = i:u; is adjacent to vertex v in G}

Clearly, |S|= deg (u) and T=deg (v) in G where |X|

denotes the number of elements in a set X. We assert that
SnT= andSUT sn -1. For if, iESNT, then the edges
(u, u:) and (u, v) would be in G and then u = uj, u2,
, j-1, Mi,
Wns n-1 , UËt1, U1 Would form a Hamiltonian circuit in G, which is
a contradiction. Further, SUTC {1, 2, .., n}. But since vertex
u1 =u is neither adjacent to unor adjacent to v, 1SUT.

Therefore,
|SUT| si-1
Now, we have
3.104
Discrete Mathematics
deg (u) t deg (v) = |S| +|T|
= |SUT| SnT=
<n-1

But this is a contradiction to our hypothesis.

Hence our assumption is wrong. So, G is Hamiltonian. kni
 Example 14.. In a complete graph with n vertices there are
(0-1)/2 edge-disjoint Hamiltonian circuits.
circuits, if nis an odd number 23.
Proof : A complete graph G of n vertices has n(n - 1)/2 edges.
and a Hamiltonian circuit in G consists of n edges.

Therefore, the number of edge-disjoint Hamiltonian circuits in

Gcannot exceed (n - 1)/2. That there are (n - 1)/2 edge-disjoint
Hamiltonian circuits, when n is odd.
5

3 n-2

2 1

4 n-1

n-3

The subgraph (of a complete graph of n vertices) in figure is a

Hamiltonian circuit Keeping the vertices fixed on a circle, rotate the
polygonal pattern clockwise by 360/(n - 1), 2,360/(n - 1),
3.102
Discrete Mathematics
3.360/(n - 1), .. (n(n - 3)/2.360 / (n - 1) degrees. Observe that,
that each
rotation produces a Hamiltonian circuit that has no edge in
with any of the previous ones. common
Thus we have (n - 3)/2 new Hamiltonian circuits, all
edge disjoint
from the one is figure and also edge disjoint among themselves. Hence
the theorem.
 6

Example 9. Solve the travelling salesman problem for

the following figure.
the graph in

B
2 1
C
1
3
5
G H 3

7 6

F 2 E D
2

Solution:

This graph has the following two Hamiltonian circuits

(a) A ’ B’ C’D’E’F’H’G A
(b) A’ B
’C’D’E’F’G’H’A
The total weights of Hamiltonian circuits described in (a)
and (b)
are 22 and 25
respectively.
Because the total weight of Hamiltonian circuit in (a) is minimum,
salesman should travcl according to circuit in (a).
 2>

Example 10. Explain Konisberg bridge problem. Represent the

by means of graph. Does the problem have a solution?
and B
Solution : There are two islands Aand formcd by a
problem
are connected to
cach other and to the
the river banks Cand D river.
Dby They
of 7bridgcs. The problem is to start from any one of the 4 land means
A. B. C, D, walk across cach bridge cxactly once and return t
starting point.

A
B

This problem is the famous Konisberg bridge problem.

Graphs and Graph models 3.91

When the situation is represented by a graph, with verticcs

renresenting the land areas and the edges and the bridges.
This problem is the same as that drawing the graph without
the pen from the paper and without retracing any line.
lifting

In other words, the problem is to find whether there is

Eulerian
circuit in the graph. But a connected graph has an Eulerian circuit if
and only if each of its vertices is of even degree.

In the prsent case all the vertices are of odd degree.

Hence,
Konisberg bridge problem has no solution.