Vocab
Hamilton Paths and Circuits
Euler Paths and Circuits
TSP
100

The degree of A

What is 3?
100

The name of a Hamilton Path in this graph.

What is D-A-E-C-B?

What is B-C-E-A-D?

What is E-A-D-C-B?

What is E-A-B-C-D?

What is E-C-B-A-D?

What is E-C-D-A-B?

100
A graph that has only 2 odd degree vertices.

What is a Euler Path?

100

Find the nearest-neighbor algorithm answer to the TSP starting and ending at A

33

A-B-C-D-A (5+7+9+12)

200

This vocab word describes the relationship between vertices b and c

What is adjacent?

200

The name of a Hamilton Cycle in the graph.

What is 0-1-3-4-2?

What is 1-3-4-2-0?

Etc.

200

A graph that has no odd vertices.

What is a Euler Circuit?

200

Find the Cheapest-Link Algorithm solution to the TSP starting and ending at B. 

31

B-A-C-D-B

5+6+9+11

300

This word describes the fact that all vertices are touching at least one other vertex

What is connected?

300

Hamilton Path for this graph

What is B-C-E-A-D?


300

An Euler Circuit for the graph.

What is EA - AD - DE - EC - CB - BE?

What is EA - AD - DE - EB - BC - CE?

What is ED - DA - AE - EC - CB - BE?

What is ED - DA - AE - EB - BC - CE?

300

Find the Nearest Neighbor Algorithm solution to the TSP starting and ending at C. 

190

C-B-D-A-C

30+40+65+55

400

This picture is NOT an example of this vocab word.

What is complete?

400

Hamilton Circuit for this graph

What is untraceable?

400

An Euler Path in this graph.

What is RW - WU - UV - VR - RS - SV?

Etc.

400

Find the Cheapest-Link Algorithm solution to the TSP starting and ending at A. 

190

A-C-B-D-A

30+40+55+65

500

A kgraph

What is  

500

A school district has five high schools, and they each play each other in one game of football. The county needs to rank their teams.Here are the outcomes of each game:

∙ The Bears beat the Wildcats and the Tigers. 

∙ The Wildcats beat the Tigers. 

∙ The Bulldogs beat the Bears, the Wildcats, and the Tigers. 

∙ The Rams beat the Bears, the Wildcats, the Bulldogs, and the Tigers.


The ranking.

What is Rams, Bulldogs, Bears, Wildcats and Tigers?


500

The town in Russia that had 7 bridges, that became famous in the mathematics of Graph Theory.

What is Konigsberg?

500

Find the BEST answer to the TSP starting and ending at A

190

A-C-B-D-A or A-D-B-C-A

55+30+40+65