Which of the following best describes a HAMILTONIAN PATH.
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 VERTEX 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 the starting vertex.

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

Step-by-step explanation:

answer 1 : option "c"

answer 2 : option "d"

answer 3 : option "b"

answer 4 : option "d"

answer 5 : option "b"

answer 6 : option "a"

answer 7 : option "c"

answer 8 : option "d"

answer 9 : option "c"

answer 10 : option "d"

answer 11 : option "c"

answer 12 option "b"

answer 13 option "c"

answer 14 option "c"

answer 15 option "d"

answer 16 option "a"

answer 17 option "b"

answer 18 option "c"

answer 19 option "a"

answer 20 option "a"

answer 21 option "c"

d