Math Game 6 Jeopardy Template

Hamilton circuits and paths	complete graph	Key terms	Trees	misc
100 What is a Hamilton circuit circuit that includes each vertex once and only once, and must return to starting vertex	100 What is (N-1)! used for in completed graphs Hamilton circuits	100 What is a weighted graph a graph where a value is assigned to each edge	100 What is a sub graph a graph made from the original graph	100 What does minimal mean in a graph network with lowest weight
200 What is the difference between a Hamilton circuit and a Hamilton path a circuit must return to the start	200 How many Hamilton circuits are there if n=5 if it is a complete graph 24	200 What is weight the value of an edge	200 What is a span reaches all vertices	200 What is cost the weight of a edge
300 What is the difference between Hamilton and Euler Hamilton- all vertices Euler- all edges	300 What is the minimum value a vertices can have and why 2 because it has to connect back with out having any open ends	300 What is a tour a trip to all sights and back in a Hamilton circuit	300 What is a spanning tree a network with no vertices that reach all vertices and edges	300 What is the first step of brute force list all Hamilton circuits
400 who is the Hamilton path and circuit named after William Rowan Hamilton	400 What is what is a complete graph where every vertices of a graph is connected by a direct edge	400 What is a optimal tour a tour with the least amount of weight	400 What is a tree a network with no circuits	400 What is the first step to cheapest link select link with lowest weight
500 What is another name for a Hamilton path of circuit a Hamiltonian path or circuit	500 in the formula (N(N-1)/2) what does N stand for number of vertices	500 What is a edge a line connecting two or more vertices	500 What does MST stand for minimal spanning tree	500 What is the redundancy formula R=M-(N-1)

math game

Press F11 for full screen mode