Hamiltonian Circuits - Discrete Ch 2

A Hamiltonian cycle is

• A cycle that includes every vertex

• A cycle that includes every vertex more than once

• A cycle that includes every edge

• A cycle that includes every edge more than once

A graph in which every vertex is directly connected by a single edge to each of the other vertices

• Tree

• Hamiltonian cycle

• Isomorphic graph

• Complete graph

A connected graph with no cycles

• Isomorphic graph

• Tree

• Planar graph

• Complete graph

Which of these algorithms could I use to find a minimum spanning tree?

• Planarity algorithm

• Kruskal's algorithm

• Djikstra's algorithm

• Floyd's algorithm

A Euler's or Hamiltonian Circuit end and start in the same place. 

• True
• False

In a Hamiltonian Path or Circuit, you must use each edge. 

• True 
• False

In a Hamiltonian Circuit or Path, you can only use each vertex once. 

• True
• False

In a Euler's Circuit or Path, you must use each edge once. 

• True
• False

In a Euler's Circuit or Path, you cannot use a vertex twice. 

• True
• False

Does this graph have a Hamiltonian Circuit?

• True
• False