A cycle that covers all the vertices of the given graph, without having to…
TPSC Computer/IT Posts 2019Modified — slightly modified from the official paper; see the solution
A cycle that covers all the vertices of the given graph, without having to cover any vertex twice is called
- A.
Hamiltonian cycle
- B.
Hamming cycle
- C.
Euler cycle
- D.
None of the above
Attempted by 178 students.
Sign up free to check your answer
Sign up freeLoading lesson…

