SOLUTION: Is it A? I want to check my answer. Which of the following best describes a Hamiltonian Circuit. Group of answer choices A. A path that uses each VERTEX of a graph exactly

Algebra ->  Sequences-and-series -> SOLUTION: Is it A? I want to check my answer. Which of the following best describes a Hamiltonian Circuit. Group of answer choices A. A path that uses each VERTEX of a graph exactly      Log On


   

Question 1160723: Is it A? I want to check my answer.
Which of the following best describes a Hamiltonian Circuit.
Group of answer choices
A. A path that uses each VERTEX of a graph exactly once and ends at the starting vertex.
B A path that uses each EDGE of a graph exactly once and ends at a vertex different from the starting vertex.
C. A path that uses each VERTEX of a graph exactly once and ends at a vertex different from the starting vertex.
D. A path that uses each EDGE of a graph exactly once and ends at the starting vertex.
Answer by jim_thompson5910(35256) About Me  (Show Source):
You can put this solution on YOUR website!

Yes you are correct. The answer is A.

A Hamiltonian path is one where each vertex is used only once. You can stop at any vertex you want (it doesn't have to be the first starting point). A circuit is one where you end up where you started. Combining those two concepts, a Hamiltonian circuit is what choice A describes.

In contrast, a Euler circuit is one where every edge is used exactly once and you end up where you started. An Euler path is where you use each edge only one time, and you end up somewhere other than the starting point.