Question: Let G= (V, E) be a directed a cyclic graph. A Hamiltonian path in G is a path which visits each vertex of V exactly
Let G= (V, E) be a directed a cyclic graph. A Hamiltonian path in G is a path which visits each vertex of V exactly once. Prove the following property:
G has a Hamiltonian path
if and only if
G has a unique topological ordering.
Step by Step Solution
3.49 Rating (156 Votes )
There are 3 Steps involved in it
To prove the statement well consider two parts proving that if G has a Hamiltonian path then G has a ... View full answer
Get step-by-step solutions from verified subject matter experts
