Unit 4 T P1

Circuits start and stop at

• same vertex

• different vertices

Tags

CCSS.5.G.A.1

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 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 an Euler Path.

• True

• False

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

Paths start and stop at

• same vertex
• different vertices

Tags

CCSS.HSG.CO.A.1

Identify as a Hamiltonian

Circuit, Path, or Neither

• Circuit

• Path

• Neither

Identify as a Hamiltonian

Circuit, Path, or Neither

• Circuit

• Path

• Neither

Identify as a Hamiltonian

Circuit, Path, or Neither

• Circuit

• Path

• Neither

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

• True 
• False