WorksheetsUnit 4 Q1
Total questions: 23
Worksheet time: 12hrs 30mins
Circuits start and stop at
the same vertex
different vertices
the edge
Never stop
This graph will have an Euler Circuit.
True
False
How do we quickly determine if a graph will have an Euler Circuit?
All even degree vertices
Exactly 2 odd degree vertices
Which of the graphs below have Euler circuits?
I only
II only
Both I and II
Neither I and II
What is the degree of vertex A in the graph ?
3
5
7
11
This graph will have an Euler Path.
True
False
What is the degree of vertex F in the graph ?
3
4
5
11
To be classified as an Euler path, the vertices of a graph must....
All be odd degrees.
all be even degrees.
Have 2 odd degrees.
Have 2 even degrees.
Choose the correct term to match each definition: Lines or curves that connect vertices.
Regions
Vertices
Edges
Paths
Is this a HAMILTONIAN
Circuit, Path, or Neither?
Circuit
Path
Neither
Is this a HAMILTONIAN
Circuit, Path, or Neither
Circuit
Path
Neither
Is this a HAMILTONIAN
Circuit, Path, or Neither
Circuit
Path
Neither
What is the weight of the shortest path from A to F?
5
7
9
11
The graph shown contains NO cycles.
True
False
The graph shown contains NO cycles.
True
False
The number of vertices in a minimum spanning tree that has 12 edges is
A Hamiltonian cycle is
A cycle that includes every vertex
A cycle that includes every vertex more than once
A cycle that includes every edge
A cycle that includes every edge more than once
Yes
No
Use the table to to find the most efficient network (i.e. lowest total).
26
20
28
24
Make an efficient network (lowest total)
50
200
48
61
Turn this Euler Path into an Euler Circuit. What is the original number and the new number?
Original: 27
New: 34
Original: 27
New: 35
Original: 27
New: 37
Original: 27
New: 8
