Hamilton Circuits

How many Hamilton Circuits are in a complete graph with 5 vertices

• 5

• 15

• 24

• 120

How many edges are on a completed graph with 5 vertices

• 5

• 15

• 24

• 120

Any Hamilton Path is also an Euler path

• true

• false

The efficient and accurate method for finding the cheapest Hamilton Circuit is

• brute force

• nearest neighbor

• cheapest link

• there isn't one

The number of circuits you have to check to find the cheapest circuit on a complete graph with 25 vertices is

• more than the population of Goldsboro

• more than the population of the United States

• more than the population of China

• more than the population of earth

All of the following are modeled by a Hamilton Circuit except

• a band going on tour to several cities

• a salesperson traveling to several cities to sell stuff

• a security guard walking his beat in a neighborhood

• a trucking company delivering packages to people in several cities