NIELIT 2017 July Scientist B (CS) - Section B: 13

Question

For the graph shown, which of the following paths is a Hamilton circuit?

• A. $ABCDCFDEFAEA$
• B. $AEDCBAF$
• C. $AEFDCBA$
• D. $AFCDEBA$

Answer 1

C is the answer.

Hamiltonian circuit is a cycle where every node is visited exactly once.

Answer 2

A) ABCDCFDEFAEA           : Most of the vertices are repeating can`t be a Hamiltonian iteration.

B) AEDCBAF                       : Starting and ending vertex is not same contradicts the def of a circuit

C) AEFDCBA         : Its right sequence follows All definition. CORRECT ANSWER.

D) AFCDEBA        : There is no way to access B after traversing E without repeating any other intermediate vertex.

Answer 3

A hamiltonion circuit in a connected graph is defined as a closed walk that traverses every vertex of G exactly once ,except of course the starting vertex

A)No A because A is repeated Several times

B)Its not closed walk

C)Yes it is closed walk and all vertex traversed

D)No its not walk

Answer 4

A Hamiltonian cycle, also called a Hamiltonian circuit, Hamilton cycle, or Hamilton circuit, is a graph cycle (i.e., closed loop) through a graph that visits each node exactly once. A graph possessing a Hamiltonian cycle is said to be a Hamiltonian graph.
Here, Option A: A,F and E are repeated several times.
Option B: It is not a cycle. It means, not closed walk
Option C: It is closed walk and all vertex traversed. So this is final answer.
Option D: It’s not a closed walk.