How many Hamiltonian paths does the following graph have?
(a) 1
(b) 2
(c) 0
(d) 3
I had been asked this question in class test.
Enquiry is from Checksum, Complexity Classes & NP Complete Problems topic in division Checksum, Complexity Classes & NP Complete Problems of Data Structures & Algorithms II