WorksheetsGraphs and Networks Revision
Total questions: 55
Worksheet time: 28mins
A bridge exists between two vertices. Which vertices are they?
(a)
The graph has (a) edges.
The graph has (a) edges.
What is the degree of vertex C?
(a)
What is the degree of vertex B?
(a)
The graph has (a) edges.
The graph has (a) odd vertices.
Which graph is not isomorphic to the others?
(a)
Which graph is not isomorphic to the others?
(a)
Which graph represents the following adjacency matrix?
Which graph represents the following adjacency matrix?
Which graph represents the following adjacency matrix?
Is this graph conntected?
Connected
Not Connected
Is this graph conntected?
Connected
Not Connected
A bridge exists between two vertices. Which vertices are they?
(a)
The graph has (a) edges.
What is the degree of vertex F?
(a)
The graph has (a) even vertices.
A bridge exists between two vertices. Which vertices are they?
(a)
What is the sum of the degrees of the vertices of the following graph?
(a)
What is the sum of the degrees of the vertices of the following graph?
(a)
What is the sum of the degrees of the vertices of the following graph?
(a)
State the value of f
(a)
Is the graph in Planar Form?
Planar Form
Not Planar Form
Is the graph in Planar Form?
Planar Form
Not Planar Form
Is the graph in Planar Form?
Planar Form
Not Planar Form
Is the graph in Planar Form?
Planar Form
Not Planar Form
State the value of f
(a)
For a planar connected graph, find f given v = 3 and e = 8
(a)
For a planar connected graph, find f given v = 1 and e = 7
(a)
For a planar connected graph, find e given f = 6 and v = 9
(a)
For a planar connected graph, find e given f = 3 and v = 10
(a)
For a planar connected graph, find v given e = 10 and f = 5
(a)
For a planar connected graph, find v given e = 8 and f = 5
(a)
Is the graph in Planar Form?
Planar Form
Not Planar Form
Find the shortest path from Bartow to Kenton in the network shown
B−S−O−K
B−S−M−O−K
B−S−M−K
B−C−M−K
Find the shortest path from Kinglake to Healesville in the network shown
K-S-Y-H
K-T-H
K-Y-H
K-T-Y-H
Find the shortest path from Croghon to Stratmoore in the network shown
C−B−S
C−O−S
C−M−S
C−M−O−S
Find the shortest path from A to F in the network shown
A–B–E–F
A–C–D–F
A–B–D–F
A–C–B–E–F
Find the shortest path from A to D in the network shown
A–B–D
A–C–D
A–E–D
A–B–C–D
What distance is travelled on the path A–B–E–H–I?
(a)
What distance is travelled on the circuit F-E-D-H-E-A-C-F?
(a)
How long will it take to drive from C to D via B?
(a)
How far is the drive from Nhill to Horsham via Natimuk?
(a)
Find the shortest distance between Nhill and Donald
(a)
Determine whether the graph has a Eulerian trail, a Eulerian circuit or neither
Eulerian Trail
Eulerian Circuit
Neither
Determine whether the graph has a Eulerian trail, a Eulerian circuit or neither
Eulerian Trail
Eulerian Circuit
Neither
Determine whether the graph has a Eulerian trail, a Eulerian circuit or neither
Eulerian Trail
Eulerian Circuit
Neither
Determine whether the graph has a Eulerian trail, a Eulerian circuit or neither
Eulerian Trail
Eulerian Circuit
Neither
Determine whether the graph has a Eulerian trail, a Eulerian circuit or neither
Eulerian Trail
Eulerian Circuit
Neither
Identify the walk in each of the graphs below as a trail, path, circuit or walk only
Trail
Path
Circuit
Walk Only
Identify the walk in each of the graphs below as a trail, path, circuit or walk only
Trail
Path
Circuit
Walk Only
Identify the walk in each of the graphs below as a trail, path, circuit or walk only
Trail
Path
Circuit
Walk Only
Identify the walk in each of the graphs below as a trail, path, circuit or walk only
Trail
Path
Circuit
Walk Only
Identify the walk in each of the graphs below as a trail, path, circuit or walk only
Trail
Path
Circuit
Walk Only
