Scribd
Upload
43 views

Graphs 3 Print

This document discusses graph theory concepts including Euler cycles, Hamiltonian cycles, and line graphs. It provides definitions and theorems regarding when graphs have Euler and Hamiltonian cycles. Specifically, it states that a connected undirected graph has an Euler cycle if each vertex is of even degree. It also presents an algorithm for constructing Euler cycles in such graphs. Additionally, it discusses line graphs and how Euler cycles in a graph G translate to Hamiltonian cycles in its line graph L(G).

Uploaded by

Pi
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
43 views

Graphs 3 Print

This document discusses graph theory concepts including Euler cycles, Hamiltonian cycles, and line graphs. It provides definitions and theorems regarding when graphs have Euler and Hamiltonian cycles. Specifically, it states that a connected undirected graph has an Euler cycle if each vertex is of even degree. It also presents an algorithm for constructing Euler cycles in such graphs. Additionally, it discusses line graphs and how Euler cycles in a graph G translate to Hamiltonian cycles in its line graph L(G).

Uploaded by

Pi
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

V.

Adamchik 21-127: Concepts of Mathematics

Graph Theory
Victor Adamchik

Fall of 2005

Plan
1. Euler Cycles
2. Hamiltonian Cycles

Euler Cycles
Definition.
An Euler cycle (or circuit) is a cycle that traverses every edge of a graph exactly once. If
there is an open path that traverse each edge only once, it is called an Euler path.

The left graph has an Euler cycle: a, c, d, e, c, b, a and the right graph has an Euler path
b, a, e, d, b, e
V. Adamchik 2

Theorem
A connected undirected graph has an Euler cycle each vertex is of even degree.

Proof.
Each time the path passes through a vertex it contributes two to the vertex's degree,
except the starting and ending vertices. If the path terminates where it started, it will contrib-
ute two to that degree as well.
We start with any vertex and choose a next vertex from all adjacent vertices in random
order. We continues in this manner. After finite number of steps, we will end in the vertex
we started with. If we traverse all edges, we build an Euler cycle, Otherwise, consider a
subgraph H obtained from the original graph by deleting that cycle. Each vertex of H has
even degree. In the above left pcture graph H might consist of vertices c, d, e. The original
graph and H must have one vertex in common. We start with this vertex and repeat the
procedure. We repeat all these until all edges are traversed.
QED.

The proof to the theorem produces an algorithm.


Algorithm (constructing Euler cycles)
G is a connected graph with even edges
We start at a proper vertex and construct a cycle. We decrease the vertex degree
each time we visit it. If this cycle contains all edges of the graph, stop. Otherwise, select a
vertex of degree greater than 0 (that belongs to the graph as well as to the cycle!) and con-
struct another cycle. Next, splice these two cycles into one. If a join cycle contains all edges
of the graph, stop. If not, select a common vertex of degree greater than 0 and construct a
cycle, and so on.

Consider the following example. On each step we maintain an array of degree


V. Adamchik 21-127: Concepts of Mathematics

1. Start at 3 and discover cycle (3,5,4,3).


2. Start at 3 and discover cycle (3,2,1,3)
3. splice them in one (3, 5, 4, 3, 1, 2, 3)
4. start at 1 and discover (1,0,6,5,1)
5. splice, to get a final cycle (3, 5, 4, 3, 1, 0, 6, 5, 1, 2, 3)

Theorem
A connected undirected graph has an Euler path (not a cycle) if it has exectly two
vertices of odd degree.

Consider the graph. It has two vertices of odd degrees, since the graph has an Euler path.

Theorem
A digraph has an Euler cycle if it strongly connected and indeg vk outdeg vk for
all vertices

A graph below is not Eulerian.


V. Adamchik 4

Hamiltonian Cycles
Definition.
A Hamiltonian cycle is a cycle that traverses every vertex of a graph exactly once.

If there is an open path that traverses each vertex only once, it is called a Hamiltonian path.

The terminoogy came from the Icosian puzzle, invented by Hamilton in 1857.
See http://www.puzzlemuseum.com/month/picm02/200207icosian.htm

There was a wooden "schematic" dodecahedron with a peg at each vertex labeled with
different cities. The goal was to start at a city and travel along edges, visiting each of the
other 19 cities exactly ones.

There are no known conditions which are both necessary and sufficient. There are a few
sufficient considitons.

For a graph to have a Hamiltonian cycle the degree of each vertex must be two or more.
V. Adamchik 21-127: Concepts of Mathematics

In general, the more edges a graph has, the more likely it is to have a Hamiltonian cycle.

The Petersen graph does not have a Hamiltonian cycle.

Theorem (Dirac)
Let G be a simple graph with n 3 vertices. If every vertex has degree at least n 2, then G
has a Hamiltonian cycle.

The best known algorithm for finding a Hamiltonian cycle has an exponential worst-case
complexity.

Definition.
The line graph L G of graph G has a vertex for each edge of G, and two of these vertices
are adjacent iff the corresponding edges in G have a common vertex.
V. Adamchik 6

Eulerian cycles of a graph G translate into Hamiltonian cycles of L G .

Exercise 1.
If an edge has a vertex of degree d1 at one end and a vertex of degree d2 at the other, what
is the degree of its corresponding vertex in the line graph?

Answer.
d1 d2 2

Exercise 2.
Suppose a graph G is regular of degree d. Is L G necessarily a regular graph? and if so of
what degree?

Answer.
L G is a regular graph of degree 2 d 1

Exercise 3.
Why the line graph of a regular graph, if connected, always has an Euler cycle?
V. Adamchik 21-127: Concepts of Mathematics

Answer.
L G is a regular graph of even degree.

Exercise 4.
Given G V, E with degree sequence d1 , d2 , ..., dV . Count the number of edges in
LG E, X .

Answer.
Each edge in L G corresponds to a pair of adjacent edges in G. Therefore, we have to
count pair of edges associated with each vertex in G

V
dk
X
2
k 0

You might also like