Networks
New Zealand
Level 7 - NCEA Level 2
Hamiltonian Paths and Cycles
Interactive practice questions
Which of the following correctly describes a Hamiltonian cycle?
A cycle that passes through every vertex and every edge exactly once.
A
A path that visits every vertex exactly once.
B
A cycle that passes through every edge exactly once.
C
A path that begins and ends at the same vertex and passes through every other vertex exactly once.
D
Easy
< 1min
The following questions relate to complete graphs.
Easy
1min
What is an optimal solution of the traveling salesman problem for a weighted graph?
Easy
< 1min
Is it possible to draw a Hamiltonian path on the following diagram?
Easy
< 1min
Sign up to access Practice Questions
Get full access to our content with a Mathspace account