Networks

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

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

Less than a minute

Sign up to try all questions

Choose appropriate networks to find optimal solutions

Apply network methods in solving problems