Search

Question 1 of 8

No calculator

Consider this graph with named vertices

Graph; every repeated endpoint pair in the full list denotes separate parallel edges. Vertices in listed order: [Moe | Yarram | Sale | Traralgon]. Full edge list: Yarram–Moe; Traralgon–Yarram; Moe–Sale; Traralgon–Sale; Moe loop.MoeYarramSaleTraralgon
(a)1 mark

How many vertices does the graph have?

(b)1 mark

How many edges does the graph have?