Scribd
Upload
9 views8 pages

Graph6 E11

The document covers fundamental concepts of graph theory, focusing on Euler and Hamiltonian paths and circuits. It defines Euler paths and circuits, provides necessary conditions for their existence, and discusses examples including the Königsberg bridge problem. Additionally, it explores properties of Hamiltonian graphs and poses exercises for further practice.

Uploaded by

dfanish18
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
9 views8 pages

Graph6 E11

The document covers fundamental concepts of graph theory, focusing on Euler and Hamiltonian paths and circuits. It defines Euler paths and circuits, provides necessary conditions for their existence, and discusses examples including the Königsberg bridge problem. Additionally, it explores properties of Hamiltonian graphs and poses exercises for further practice.

Uploaded by

dfanish18
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/ 8

Discrete Mathematics and Graph Theory

Module III
Fundamentals of Graphs
Graphs: Introduction, Isomorphism, Subgraphs, Walks, Paths, Circuits, Connectedness, Components, Euler
Graphs, Hamiltonian Paths and Circuits.
_____________________________________________________

Euler Graph, Hamiltonian Path and Circuit

Definition 1.
A path of a graph G is called Euler path, if it contains each edge of G exactly once.
A circuit of a graph G is called Euler circuit, if it contains each edge of G exactly once.
A graph, that contains an Euler circuit, is called an Euler graph.

Example 1. Which of the following graphs have an Euler circuit? Of those that do not, which
have an Euler path?

Solution. 𝐺1 has an Euler circuit, for example, a, e, c, d, e, b, a.


𝐺2 does not have an Euler circuit. 𝐺2 does not have an Euler path.
𝐺3 does not have an Euler circuit. However, 𝐺3 has an Euler path, namely, a, c, d, e, b, d, a, b.

Theorem 1. (Necessary & Sufficient Condition for the Existence of an Euler Circuit)
A connected multigraph with at least two vertices contains an Euler circuit if and only
if each of its vertices is of even degree.

Theorem 2. (Necessary & Sufficient Condition for the Existence of an Euler Circuit)
A connected multigraph has an Euler path but not an Euler circuit if and only if it has
exactly two vertices of odd degree.
Example 2. Which graphs shown below have an Euler path?

Solution. G1 contains exactly two vertices of odd degree, namely, b and d. Hence, it has an Euler
path that must have b and d as its endpoints. One such Euler path is d, a, b, c, d, b.
Similarly,G2 has exactly two vertices of odd degree, namely, b and d. So it has an Euler
path that must have b and d as endpoints. One such Euler path is b, a, g, f, e, d, c, g, b,
c, f, d.
G3 has no Euler path because it has six vertices of odd degree.

We can now solve the Königsberg bridge problem.

Solution of Königsberg Bridge Problem


Returning to eighteenth-century Königsberg, is it possible to start at some point in the town, travel
across all the bridges, and end up at some other point in town? This question can be answered in
two ways:

 Because the multigraph representing these bridges has four vertices of odd degree,
it does not have an Euler circuit. There is no way to start at a given point, cross each
bridge exactly once, and return to the starting point.

 This question can also be answered by determining whether there is an Euler path in
the multigraph representing the bridges in Königsberg. Because there are four
vertices of odd degree in this multigraph, there is no Euler path, so such a trip is
impossible.
Definition. Hamiltonian Path and Circuit
A path of a graph G is called Hamiltonian path, if it contains each vertex of G exactly
once.
A circuit of a graph G is called Hamiltonian circuit, if it contains each vertex of G
exactly once, except the starting and the ending vertices (which are one and the
same) which appear twice.
A graph, that contains a Hamiltonian circuit, is called an Hamiltonian graph.

Properties of Hamiltonian Graphs


1. The path obtained by deleting any on edge from a Hamiltonian circuit is a
Hamiltonian path.
2. A Hamiltonian circuit contains a Hamiltonian path, but a ghaph containing a
Hamiltonian path need not have a Hamiltonian circuit.
3. A given graph may contain more than one Hamiltonian circuits.
4. A complete graph 𝐾𝑛 has a Hamilton circuit whenever n ≥ 3.

Eulerian Graph Vs. Hamiltonian Graph


Example 3. Which of the following simple graphs have a Hamilton circuit or, if not, a Hamilton
path?

Solution. 𝐺1 has a Hamilton circuit: a, b, c, d, e, a.


𝐺2 has no Hamilton circuit. However, 𝐺2 has a Hamilton path, namely, a, b, c, d.
𝐺3 has neither a Hamilton circuit nor a Hamilton path, because any path containing all
vertices must contain one of the edges {a, b},{e, f }, and {c, d} more than once.

Example 4. Show that neither of the following graphs has a Hamilton circuit.

Solution. There is no Hamilton circuit in G because G has a vertex of degree one, namely, e.
Now consider H. Because the degrees of the vertices a, b, d, and e are all two, every edge incident
with these vertices must be part of any Hamilton circuit. It is now easy to see that no Hamilton
circuit can exist in H, for any Hamilton circuit would have to contain four edges incident with c,
which is impossible.

Example 5. (For Students)


Show that 𝐾𝑛 has a Hamilton circuit whenever n ≥ 3.
Solution. We can form a Hamilton circuit in 𝐾𝑛 beginning at any vertex. Such a circuit can be
built by visiting vertices in any order we choose, as long as the path begins and ends at the same
vertex and visits each other vertex exactly once. This is possible because there are edges in 𝐾𝑛
between any two vertices.

Example 6. The complete bipartite graph 𝐾2,4 has an Eulerian circuit, but is non-Hamiltonian.
Explain why?

Solution.

Hint: Since every vertex has even degree, the graph has an Eulerian circuit. In addition, it doesn't
contain a Hamiltonian circuit.

Example 7. (For Students)


Give an example of a graph which contains
(i) An Euler circuit that is also a Hamiltonian circuit.
(ii) An Euler circuit and a Hamiltonian circuit that are distinct.
(iii) An Euler circuit, but not a Hamiltonian circuit.
(iv) A Hamiltonian circuit, but not an Euler circuit.
(v) Neither an Euler circuit nor a Hamiltonian circuit.

Solution.
(i) Both Hamiltonian circuit and Eulerian circuit
(ii) An Euler circuit and a Hamiltonian circuit that are distinct.

(iii) Eulerian circuit but not a Hamiltionian circuit

Fig 1. Eulerian circuit but not a Hamiltionian circuit

Fig 2. Eulerian circuit but not a Hamiltionian circuit

(iv) Hamiltonian circuit but not a Eulerian circuit


(v) Neither an Euler circuit nor a Hamiltonian circuit.

Exercise Questions for Regular Practice (For Students)

1. Does the following graph contain a Hamilton path? If so, find such a path. If it does not,
give an argument to show why no such path exists.

2. Does the following graph contain a Hamilton path? If so, find such a path. If it does not,
give an argument to show why no such path exists.

3. For which values of m and n does the complete bipartite graph 𝐾𝑚,𝑛 have a Hamilton
circuit?
4. Explain Konisberg seven bridge problem. Represent the problem by means of graph. Does
the problem have a solution?
5. Give an example of graph which has
(i) Eulenian circuit but not a Hamiltanian circuit.
(ii) Hamiltonian circuit but not Eulerian circuit.
(iii) Both hamiltonian circuit and Eulerian circuit.
6. Draw a graph that has a Hamilton circuit but no Euler circuit. Specify the Hamilton circuit,
and explain why the graph has no Euler circuit.

***

You might also like