AQR: Unit 7 Activity 4, 6, & 7 Quiz

In comparing an Euler Path to a Hamiltonian Path, which statement is true.

• An Euler Path must touch each vertex once. A Hamiltonian Path much touch each edge once.

• An Euler Path must begin and end at the same vertex. A Hamilton Path does not.

• An Euler Path much touch each edge once. A Hamiltonian Path much touch each vertex once.

• A Hamiltonian Path must begin and end at the same vertex. An Euler Path does not.

Identify each as a Hamiltonian

Circuit, Path, or Neither

• Circuit

• Path

• Neither

Identify each as a Hamiltonian

Circuit, Path, or Neither

• Circuit

• Path

• Neither

Identify each as a Hamiltonian

Circuit, Path, or Neither

• Circuit

• Path

• Neither

Identify each as a Hamiltonian

Circuit, Path, or Neither

• Circuit

• Path

• Neither

Identify each as a Hamiltonian

Circuit, Path, or Neither

• Circuit

• Path

• Neither

A cycle is...

• A path that starts and stops at different vertices.

• A path that starts and stops at the same vertex where backtracking is allowed.

• A path that starts and stops at the same vertex and uses every edge exactly once.

• A path that starts and stops at the same vertex and does not use any edge more than once.

If there is a cycle in the network, we have an efficient network.

• True

• False

The graph shown contains NO cycles.

• True

• False

The graph shown contains NO cycles.

• True

• False