Compare two graphs based on the total number of Hamiltonian paths

47 Views Asked by At

I have two graphs, say, A and B. It is given that these two graphs have at-least one Hamiltonian path. I want to compare these two graphs based on the total number of Hamiltonian paths without exhaustively finding all of the paths. Is there any way to achieve this?