Unit06-04-HamiltonPathCircuit

Name:

Multiple Choice
Identify the choice that best completes the statement or answers the question.

Which of the below descriptions shows a possible HAMILTON PATH?

a.	EFADECBA	c.	ADEFBC
b.	FECBAD	d.	ADECBAFE

Which is the only graph below that has a Hamiltonian Path?

Which of the BEST describes a Hamiltonian Circuit.

A path that uses each edge of a graph exactly once and ends at a vertex different from the starting vertex.

A path that uses each edge of a graph exactly once and ends at the starting vertex.

A path that uses each vertex of a graph exactly once and ends at a vertex different from the starting vertex.

A path that uses each vertex of a graph exactly once and ends at the starting vertex.

Which graph below has a Hamiltonian Circuit?