Redirected
edited by
2,082 views

7 Answers

2 votes
2 votes

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.

1 votes
1 votes
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
1 votes
1 votes
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.
Answer:

Related questions

0 votes
0 votes
0 answers
1
admin asked Mar 30, 2020
1,166 views
Which of the following statements is/are TRUE for an undirected graph?Number of odd degree vertices is evenSum of degrees of all vertices is evenP onlyQ onlyBoth P and QN...
0 votes
0 votes
4 answers
2
admin asked Mar 30, 2020
1,409 views
Consider the following graph $L$ and find the bridges,if any.No bridge$\{d,e\}$$\{c,d\}$$\{c,d\}$ and $\{c,f\}$
0 votes
0 votes
3 answers
3
admin asked Mar 30, 2020
2,263 views
The following graph has no Euler circuit becauseIt has $7$ vertices.It is even-valent (all vertices have even valence).It is not connected.It does not have a Euler circui...
0 votes
0 votes
4 answers
4
admin asked Mar 30, 2020
8,021 views
If $G$ is an undirected planar graph on $n$ vertices with $e$ edges then$e\leq n$$e\leq 2n$$e\leq 3n$None of the option