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

  1. A.

    Hamiltonian cycle

  2. B.

    Hamming cycle

  3. C.

    Euler cycle

  4. D.

    None of the above

Attempted by 178 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…