Beginner
Discrete Mathematics & Math
Q19 / 100
What is a Hamiltonian path/circuit in graph theory?
Correct! Well done.
Incorrect.
The correct answer is B) A path visiting every vertex exactly once (Hamiltonian path) or a cycle doing the same (Hamiltonian circuit)
B
Correct Answer
A path visiting every vertex exactly once (Hamiltonian path) or a cycle doing the same (Hamiltonian circuit)
Explanation
Hamiltonian path: visit each vertex exactly once. Hamiltonian circuit: visit each vertex exactly once and return to start. NP-complete to determine if one exists. Related to Traveling Salesman Problem.
Progress
19/100