193k views
2 votes
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.

User Svalemento
by
8.6k points

1 Answer

4 votes

Answer:

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

Explanation:

User Louis Cruz
by
8.3k points
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

9.4m questions

12.2m answers

Categories