Scribd
Upload
67 views

12 Euler Ham PDF

This document discusses Eulerian and Hamiltonian graphs. It begins by defining an Eulerian graph as a connected graph that has a closed trail containing all edges. It then provides theorems for determining when a graph is Eulerian based on the degrees of its vertices. It also describes Fleury's algorithm for finding an Eulerian trail if one exists. The document then discusses Hamiltonian graphs, defining them as graphs that contain a Hamiltonian cycle, which is a spanning cycle. It provides necessary and sufficient conditions for a graph to be Hamiltonian as well as Dirac's algorithm for finding a Hamiltonian cycle. The remainder of the document consists of problems related to Eulerian and Hamiltonian graphs.

Uploaded by

Ernesy John Arreza
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
67 views

12 Euler Ham PDF

This document discusses Eulerian and Hamiltonian graphs. It begins by defining an Eulerian graph as a connected graph that has a closed trail containing all edges. It then provides theorems for determining when a graph is Eulerian based on the degrees of its vertices. It also describes Fleury's algorithm for finding an Eulerian trail if one exists. The document then discusses Hamiltonian graphs, defining them as graphs that contain a Hamiltonian cycle, which is a spanning cycle. It provides necessary and sufficient conditions for a graph to be Hamiltonian as well as Dirac's algorithm for finding a Hamiltonian cycle. The remainder of the document consists of problems related to Eulerian and Hamiltonian graphs.

Uploaded by

Ernesy John Arreza
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/ 10

1 Eulerian and Hamiltonian Graphs.

Definition. A connected graph is called Eulerian if


it has a closed trail containing all edges of the graph.

C
C

A A B
B
D
D

..
The Bridges of Konigsberg

Question 1: What is the necessary and sufficient con-


dition for a graph to be Eulerian?
Question 2: Is there a fast algorithm to construct an
Eulerian trail if it exists?

1
Theorem 1 A directed multigraph G is Eulerian iff
G is connected and d+(v) = d−(v) for every v ∈
V (G).

L. Euler, Solution problematis as geometriam situs per-


tinentis, Commentarii Academiae Scientiarim Impe-
rialis Petropolitanae,8:128-140, 1736.

2
Theorem 2 A connected undirected graph is Eule-
rian iff the degree of every vertex is even.

Fleury’s Algorithm

Input: An undirected connected graph;


Output: An Eulerian trail, if it exists.

If there are vertices of odd degree, halt and return


The Graph is not Eulerian;
Else
Unmark all edges of G; choose any v ∈ V (G);
i = 0; C = ∅;
for i = 1 to |E|
{ Select unmarked edge e incident to v which in not
a bridge in the spanning subgraph comprised of
unmarked edges; if such an edge does not exist,
let e be any unmarked edge incident to v;
If e = (v, u), then C = Ceu; v = u; mark e;
}
Output C is an Eulerian trail;

3
HAMILTONIAN GRAPHS
Sir William Hamilton’s Game:

Dodecahedron

A spanning cycle is called Hamiltonian. A graph is


called Hamiltonian if it has a Hamiltonian cycle.
The Knight’s Tour Puzzle: is it possible for a
knight to tour the 8×8 chess-board: to visit each square
exactly once and return to the initial square of the tour?

4
Theorem 3 (necessary condition) If G is a Hamil-
tonian graph, then
∀S, ∅ =
6 S ⊆ V (G)
the number of connected components of G − S does
not exceed |S|.

Proof. ????

5
Theorem 4 (sufficient condition) If G is a graph
with the smallest degree δ(G) ≥ |V (G)|/2, then G is
Hamiltonian.

Dirac’s Algorithm

Input: A connected graph G(V, E) with |V | ≥ 3 and


deg(v) ≥ |V |/2 for all v ∈ V ;
Output: A Hamiltonian cycle.

Choose any edge e = (u, v); let P = uv;


repeat {
repeat {
Renumber P as P = x1, x2, . . . , xk ;
if ∃v ∈ V − P adjacent to x1 (resp. xk )
then P = vP (resp. P = P v);
else find i such that (x1, xi+1), (xi, xk ) ∈ E;
let C = (x1, xi+1, . . . , xk , xi, xi−1, . . . x2);
}
if C is Hamiltonian, print out the output;
else
{find w ∈ V − P adjacent to a vertex in C;
form a new P containing C and w;}
}

6
Problem 1 Prove or disprove: If G is an Eulerian
graph with edges e and f that share a vertex, then G
has a closed Eulerian trail in which e and f appear
consequently?

Problem 2 What is the minimum number of trails


needed to decompose the Petersen graph? Is there a
decomposition into this number of trails using only
paths?

Problem 3 Show that Petersen graph is not Hamil-


tonian.

Problem 4 Prove that for no integer n > 0, Kn,n+1


is Hamiltonian.

Problem 5 For every integer n > 4, find a non-


Hamiltonian graph whose minimal vertex degree is
⌊ n−1
2 ⌋.

Problem 6 The Hamiltonian closure of a given graph


G, denoted C(G), is the supergraph of G on V (G)
obtained by iteratively adding edges between pairs of
non-adjacent vertices whose degree sum is an least
n = |V (G)|. Prove that a simple n vertex graph G
is Hamiltonian iff C(G) is Hamiltonian.
7
Problem 7 A mouse eats its way through a 3×3×3
cube of cheese by eating all the 1 × 1 × 1 subcubes.
If it starts at a corner subcube and always moves on
to an adjacent subcube (sharing a face of area 1),
can it do this and eat the center subcube last? Give
a method or prove impossible (ignore gravity :) ).

Problem 8 Prove that no 4 × n chessboard has a


knight’s tour which visits every square once and re-
turns to the starting square.

Problem 9 For which positive n are the following


graphs
(a) eulerian; (b) hamiltonian? 1. Cn; 2. Kn; 3.
Kn,n; 4. Qn.

Problem 10 (a) Prove that it is not possible for a


knight to tour a 4 × 4 chessboard, visit each square
8
exactly once, and return to the initial square. Can
it be done if returning to the original square is not
required?
(b) repeat the first part of (a) for the 7×7 chessboard.

Problem 11 Dirac’s theorem states: if the degree


of every vertex is at least p/2 where p is the order
of the graph, then the graph is hamiltonian. Prove
the following stronger statement: If ∀x, y ∈ V (G),
deg(x) + deg(y) ≥ p, then G is hamiltonian.

Problem 12 What is the minimal number of edges


in a graph with p vertices such that for any two ver-
tices x and y, deg(v) + deg(y) ≥ p?

Problem 13 Construct a non-hamiltonian graph with


p vertices and p−1
 

2 + 1 edges.

9
Problem 14 Prove that the graph below is not hamil-
tonian.

Problem 15 Prove that Kn,n+1 is non-hamiltonian


for every n > 0.

Problem 16 Prove that the maximum matching in


the n-cube has 2n−1 edges.

Problem 17 Let G be a graph with 2k vertices of


odd degree. Is it possible to partition the edges of
the graph into k edge-disjoint trails? Is it possible to
partition the edge set into fewer that k edge-disjoint
trails? Explain.

10

You might also like