Q. Consider a graph G = (V, E) where I V I is divisible by 3. The problem of finding a Hamiltonian cycle in a graph is denoted by SHAM3 and the problem of determining if a Hamiltonian cycle exits in such graph is denoted by DHAM3. The option, which holds true, is (Solved)

1. Only DHAM3 is NP-hard

2. Only SHAM3 is NP-hard

3. Both SHAM3 and DHAM3 are NP-hard

4. Neither SHAM3 nor DHAM3 is NP-hard

  • c. Both SHAM3 and DHAM3 are NP-hard
Subscribe Now

Get All Updates & News