Scribd
Upload
41 views6 pages

Hamiltonian Graph

this file is about Hamiltonian Graph

Uploaded by

preritsinghcr7
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
41 views6 pages

Hamiltonian Graph

this file is about Hamiltonian Graph

Uploaded by

preritsinghcr7
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/ 6

Hamiltonian Graph

The graph will be known as a Hamiltonian graph if there is following properties

o In the above graph, there is a closed walk ABCDEFA.


o Except for the starting vertex, it passed through every vertex of the graph
exactly once.
o At the time of walk, the edges are not repeating.
o Due to all the reasons, we can say that this graph is a Hamiltonian graph.

In other words, we can say that the above graph contains a Hamiltonian circuit. That's
why this graph is a Hamiltonian graph.

Hamiltonian Path
In a connected graph, if there is a walk that passes each and every vertex of a graph
only once, this walk will be known as the Hamiltonian path. In this walk, the edges
should not be repeated. There is one more definition to describe the Hamiltonian path:
if a connected graph contains a Path with all the vertices of the graph, this type of path
will be known as the Hamiltonian path.
Example 1: In the following graph, we have 5 nodes. Now we have to determine
whether this graph contains a Hamiltonian path.

Solution:

In the above graph, we can see that when we start from A, then we can go to B, C, D,
and then E. So this is the path that contains all the vertices (A, B, C, D, and E) only once,
and there is no repeating edge. That's why we can say that this graph has a Hamiltonian
path, which is described as follows:

Hamiltonian path = ABCDE

Example 2: In the following graph, we have 5 nodes. Now we have to determine


whether this graph contains a Hamiltonian path.
In the above graph, we can see that when we start from the E, then we can go to A, B, C, and
then D. So this is the path that contains all the vertices (A, B, C, D, and E) only once, and
there is no repeating edge. That's why we can say that this graph has a Hamiltonian path,
which is described as follows:

Hamiltonian Circuit
In a connected graph, if there is a walk that passes each and every vertex of the graph
only once and after completing the walk, return to the starting vertex, then this type
of walk will be known as a Hamiltonian circuit. For the Hamiltonian circuit, there must
be no repeated edges. We can also be called Hamiltonian circuit as the Hamiltonian
cycle.

o If there is a Hamiltonian path that begins and ends at the same vertex, then this
type of cycle will be known as a Hamiltonian circuit.
o In the connected graph, if there is a cycle with all the vertices of the graph, this
type of cycle will be known as a Hamiltonian circuit.
o A closed Hamiltonian path will also be known as a Hamiltonian circuit.

Examples of Hamiltonian Circuit


There are a lot of examples of the Hamiltonian circuit, which are described as follows:
Example 1: In the following graph, we have 5 nodes. Now we have to determine
whether this graph contains a Hamiltonian circuit.

Solution: =5

The above graph contains the Hamiltonian circuit if there is a path that starts and ends
at the same vertex. So when we start from the A, then we can go to B, C, E, D, and then
A. So this is t he path that contains all the vertices (A, B, C, D, and E) only once, except
the starting vertex, and there is no repeating edge. That's why we can say that this
graph has a Hamiltonian circuit, which is described as follows:

Hamiltonian circuit = ABCDEA

Example 2: In the following graph, we have 5 nodes. Now we have to determine


whether this graph contains a Hamiltonian circuit.

Solution:

The above graph contains the Hamiltonian circuit if there is a path that starts and ends
at the same vertex. So we will start from the E, then we can go A, B, C, D. To react to
the same vertex E, we can have to again go to vertex A. So this is the path that contains
all the vertices (A, B, C, D, and E), but vertex A is repeated to reach the initial vertex.
That's why we can say that this graph does not contain a Hamiltonian circuit.

Graph isomorphism
The isomorphism graph can be described as a graph in which a single graph can have more
than one form. That means two different graphs can have the same number of edges,
vertices, and same edges connectivity. These types of graphs are known as isomorphism
graphs. The example of an isomorphism graph is described as follows:

Conditions for graph isomorphism


Any two graphs will be known as isomorphism if they satisfy the following four
conditions:

1. There will be an equal number of vertices in the given graphs.


2. There will be an equal number of edges in the given graphs.
3. There will be an equal amount of degree sequence in the given graphs.
4. If the first graph is forming a cycle of length k with the help of vertices {v1, v2, v3, ….
vk}, then another graph must also form the same cycle of the same length k with the
help of vertices {v1, v2, v3, …. vk}.

Solution: For this, we will check all the four conditions of graph isomorphism, which
are described as follows:

Condition 1:
o In graph 1, there is a total 4 number of vertices, i.e., G1 = 4.
o In graph 2, there is a total 4 number of vertices, i.e., G2 = 4.
o In graph 3, there is a total 4 number of vertices, i.e., G3 = 4.

Here,

There are an equal number of vertices in all graphs G1, G2 and G3. So these graphs
satisfy condition 1. Now we will check the second condition.

Condition 2:

o In graph 1, there is a total 5 number of edges, i.e., G1 = 5.


o In graph 2, there is a total 5 number of edges, i.e., G2 = 5.
o In graph 3, there is a total 4 number of edges, i.e., G2 = 4.

Condition 3:

o In the graph 1, the degree of sequence s is {2, 2, 3, 3}, i.e., G1 = {2, 2, 3, 3}.
o In the graph 2, the degree of sequence s is {2, 2, 3, 3}, i.e., G2 = {2, 2, 3, 3}.

Here

There are an equal number of degree sequences in both graphs G1 and G2. So these
graphs satisfy condition 3. Now we will check the fourth condition.

Condition 4:

Graph G1 forms a cycle of length 3 with the help of vertices {2, 3, 3}.

Graph G2 also forms a cycle of length 3 with the help of vertices {2, 3, 3}.

Here,

You might also like