Search

Question 1 of 8

No calculator

The network shown will be used for the question. The vertices name sites, and the edges represent cycling routes between trail junctions

Unweighted network. Vertices in listed order: [Reserve | Orchard | Hill | Depot | Creek]. Full edge list: Reserve–Creek; Depot–Reserve; Orchard–Creek; Hill–Creek; Orchard–Hill; Depot–Creek.ReserveOrchardHillDepotCreek
(a)1 mark

Determine the number of vertices whose degree is odd

(b)1 mark

Select the statement justified by connectedness and vertex parity