Question

1. Which of the following best describes a HAMILTONIAN PATH.

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

2. Which of the below descriptions shows a possible HAMILTON PATH?
FEBCBAD <

3. Which of the following best describes a Hamiltonian Circuit.
A path that uses each VERTEX of a graph exactly once and ends at the starting vertex. <

4. Which of the following is a Hamiltonian Circuit, beginning at vertex A, for the given graph?
A. ABCDA
B. ACBDA
C. ADBCA

Answer 1

I think the answer is B!

Answer 2

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

2 is Correct

3 is Correct

4. All of the above, because an Hamiltonian Circuit goes through each VERTEX once and ends at the STARTING vertex.

I did the test made an 100