WorksheetsPHS: Euler Circuits
Total questions: 18
Worksheet time: 9mins
Tracing all edges on a figure without picking up your pencil and repeating and starting and stopping in the same spot
Euler Path
Euler Circuit
Path
Circuit
An ___________________is a one way trip through all the edges only once.
Euler Path
Euler Circuit
Path
Circuit
Any route through part or all of the graph
Euler Path
Euler Circuit
Path
Circuit
A route that starts and ends at the same vertex, it may or may not go through the entire graph.
Euler Path
Euler Circuit
Path
Circuit
A ____________ are the dots (or nodes) on your graph.
Graph
Vertex
Path
Circuit
A ____________ is a diagram of vertices and edges.
Graph
Vertex
Path
Circuit
Tracing all edges on a figure without picking up your pencil and repeating and starting and stopping in the same spot
Euler Circuit
Euler Path
Circuits start and stop at
same vertex
different vertices
Why is the route shown not an Euler circuit?
There are odd valences.
It skipped an edge.
It used a vertex more than once.
It did not stop at the vertex it started at.
Paths start and stop at
same vertex
different vertices
Choose the correct term to match each definition: Lines or curves that connect vertices.
Regions
Vertices
Edges
Paths
Circuits start and stop at
same vertex
different vertices
Is the following graph connected or disconnected? Explain why or why not.
Connected because all vertices are even.
Connected because one can get from one vertex to every other vertex on the graph
Disconnected because all vertices are even
Disconnected because one can NOT get from one vertex to every other vertex.
Choose the correct term to match each definition: Lines or curves that connect vertices.
Regions
Vertices
Edges
Paths
Is the following graph connected?
Yes
No
Euler paths must touch
all edges
all vertices
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
How do we quickly determine if the graph will have a Euler's Path
All even degree verticies
Exactly 2 odd degree verticies
Each vertex will be used once
I have no clue.
