AQR Quiz 2

Tracing all edges on a figure without picking up your pencil or repeating and starting and stopping at different spots

• Euler Circuit
• Euler Path

Circuits start and stop at 

• same vertex
• different vertices

Tags

CCSS.5.G.A.1

Which of the following is false?

• Euler Paths exist when there are exactly two vertices of odd degree.
• Euler circuits exist when the degree of all vertices are even.
• A graph with more than two odd vertices will never have an Euler Path or Circuit.
• A graph with one odd vertex will have an Euler Path but not an Euler Circuit.

This graph will have a Euler's Circuit

• True
• False

Identify the Euler's Circuit

• KLQPQOKLOMK
• KLQMPQOKNLOMK
• KLQMPQOK
• KMOLNKOQMK

This graph will have a Euler's Path. 

• True
• False

Does this graph have an Euler Path, Euler Circuit, both, or neither?

• Euler Path
• Euler Circuit
• Both
• Neither

How many distinct Hamilton circuits are there in this complete graph? (There is a formula for this)

• 24
• 6
• 120
• 10

How do we quickly determine if a graph will have a Euler's Circuit? 

• All even degree verticies
• Exactly 2 odd degree verticies
• Every Vertex will be used once
• I have no clue

Which of the following is a Hamilton circuit of the graph?

• ABCDEFGA
• ACBEGFDA
• CBGEDFAC
• CEGBADFC