How many Hamiltonian paths does the following graph have?
(a) 1
(b) 2
(c) 3
(d) 4
The question was posed to me in my homework.
My doubt is from Checksum, Complexity Classes & NP Complete Problems in section Checksum, Complexity Classes & NP Complete Problems of Data Structures & Algorithms II