Search

Question 1 of 8

No calculator

Use the unweighted network below. The vertices name sites, and the edges represent roads between Gippsland towns

Unweighted network. Vertices in listed order: [Traralgon | Warragul | Yarram | Drouin | Bairnsdale]. Full edge list: Yarram–Warragul; Warragul–Bairnsdale; Traralgon–Drouin; Bairnsdale–Yarram; Warragul–Drouin; Drouin–Yarram.TraralgonWarragulYarramDrouinBairnsdale
(a)1 mark

Determine the number of vertices whose degree is odd

(b)1 mark

Select the statement justified by connectedness and vertex parity