Search

Question 1 of 8

No calculator

The network shown will be used for the question. Vertices are labelled locations, and edges are the direct connections between them

Unweighted network. Vertices in listed order: [H | E | G | B | C]. Full edge list: B–C; G–H; E–G; H–E; C–G; B–G.HEGBC
(a)1 mark

Count the odd-degree vertices in the network

(b)1 mark

Classify the Eulerian routes that exist in this network