1 of 8 0-day streak

A full network investigation

Question 1 of 8

Calculator allowed

Consider this plan of walking tracks between park locations. The graph is connected and can be drawn in planar form. Each edge label gives the walking distance in kilometres

(a)3 marks

Count the vertices and edges, then use Euler's formula to find the number of faces

v e f

(b)1 mark

How many vertices have odd degree?

Number of odd vertices

Can every connection be traversed exactly once while returning to the starting vertex? Select the correct verdict and reason

Yes. The graph is connected and every vertex has even degree

No. The graph is connected with exactly two odd vertices, so only an open Eulerian trail is possible

No. Four odd vertices prevent an Eulerian trail or circuit

No. The edge set is split into disconnected components

(d)1 mark

Find the shortest total walking distance from Shelter to Lake

Shortest-path total (km)

(e)1 mark

Find the minimum total walking distance for a set of walking-track sections that reaches every vertex

Minimum connector total (km)