Test 3: Graphs and Networks

Section 1 (Calculator-Free)
Time Allowed: 29 minutes 29 Marks
Name: _____________________________ Teacher:__________
Instructions: Show all working clearly, in sufficient detail to allow your answers to be
checked and for part marks to be awarded for reasoning. Calculators are not permitted.

1. [6 marks: 1, 1, 1, 1, 2]
Consider the following graph:

a) Explain why the graph is not a simple graph.

b) Draw a subgraph of the graph that is a cycle.

c) Name an edge that is also a bridge.

d) Explain why a Hamiltonian cycle is not present on this graph.

e) Identify and state the length of the longest trail from C to E.

2. [3 marks: 2, 1]
Page 1 of 9
 a) Sketch the corresponding planar graph for the three-dimensional figure shown
below, labelling all vertices.

b) Verify Euler’s rule works for your planar graph.

3. [3 marks: 1, 2]
A treasure hunt is being organised and a graph showing where prizes are hidden is
shown below.

a) Highlight on the diagram above, a semi-Hamiltonian path which you could walk
in order to collect all the prizes.

b) Is it possible to create an Eulerian cycle for the treasure hunt by adding exactly
one path?
If so, show the path on the graph above. If not, justify your decision.

4. [4 marks: 2, 2]
Page 2 of 9
 Decide which of the following graph(s) are classified as bipartite graphs. Those which
are bipartite, clearly label which vertices belong in each group.

a) b)

5. [3 marks]
Construct the digraph from the adjacency matrix given.

To
A B C D
From 𝐴 𝐵 𝐶 𝐷 [0 0 0 0 1 0 1 0 0 1 1 0 1 1 1 0 ]

6. [3 marks: 1, 2]
a) Highlight the shortest path from A to K on the diagram below.

Page 3 of 9
 b) State the path and the shortest distance.

7. [4 marks: 2, 2]
For each of the following graphs, decide if the graph is:
Eulerian or semi-Eulerian or neither.
Give a brief justification in each case.

a) b)

8. [3 marks: 2, 1]
a) Determine the degree of each vertex in the following graphs and hence give the
sum of the degrees of the vertices for each graph.

Page 4 of 9
 b) Use the information from part a to give the number of edges if the sum of the
degree of the vertices is 𝑛 .

Test 3: Graphs and Networks

Section 2 (Calculator-Assumed)
Time Allowed: 26 minutes 26 Marks
Name: _____________________________ Teacher:__________
Instructions: Show all working clearly, in sufficient detail to allow your answers to be
checked and for part marks to be awarded for reasoning. Calculators are permitted.

1. [6 marks: 2, 2, 1, 1]
Consider the
following undirected graph.

There are 5 routes from A to A of length 2.

Page 5 of 9
 These routes are: A-B-A via the top path, A-B-A via lower path, A-B-A as a loop in
one direction, A-B-A as a loop in the other direction and A-C-A.

a) Construct an adjacency matrix from the undirected graph.

To
A B C D E
𝐹𝑟𝑜𝑚 𝐴 𝐵 𝐶 𝐷 𝐸 [ ]
b) Write an adjacency matrix to represent the routes of length 2 only.
To
A B C D E
𝐹𝑟𝑜𝑚 𝐴 𝐵 𝐶 𝐷 𝐸 [ ]
c) Give the actual routes of length 2 only represented from C to C in your matrix.

d) If an edge is drawn on the graph from B to C, list the walks of length one or two
between B and C?

2. [2 marks]
In 2017 there were 𝑛 teams in a round robin competition of netball where every team
played every other team. This involved 66 games. How many teams were there?

3. [4 marks: 2, 2]
The following graph shows the possible routes from Sian’s house to the library.

Page 6 of 9
a) State the shortest path and its distance from Sian’s house to the library.

b) State the shortest path and its distance from Sian’s house to the library if Sian must
call past Kristina’s house at G? A new graph has been provided for you.

4. [5 marks: 2, 1, 2]
Kristina is distributing flyers for her dog washing business. The graph below outlines
the streets she wishes to cover. In order to complete the task in the minimum time
possible, Kristina does not want to travel along a road more than once and wants to
return to her home when she is finished.

a) Describe a possible route that Kristina could take.

b) Explain why the graph is an Eulerian graph.

c) If the road AC became inaccessible would Kristina still be able to travel all of the
other streets and finish at home? Explain why or why not.

Page 7 of 9
5. [4 marks: 2, 2]
a) Complete the edges required to make the diagram below, a complete graph.

b) Using your information from part a) or other knowledge, how many edges would a
complete graph 𝐾21, have?

6. [5 marks: 1, 1, 1, 2]
Mason is planning a swimming course for a local lifesaving group. He wants the
lifesavers to complete several courses using the locations (buoys) outlined on the
following graph.

a) State a ‘walk’ that visits three locations and then finishes back at the start.

b) State a ‘path’ that visits three locations and then finishes back at the start.

c) State a ‘walk’ that visits every location only once and finishes at location D.
Page 8 of 9
c) Choose the best classification for the ‘walk’ defined in part a) and part c)
as either:
● Eularian
● Semi-Eularian
● Hamiltonian path
● Semi-Hamiltonian
● An open trail; or
● A cycle

Part a) ________________________ Part c) _______________________

END OF TEST

Page 9 of 9