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: [Bridge | Gate | Lookout | Wetland]. Full edge list: Lookout loop; Gate–Bridge; Wetland–Bridge; Lookout–Bridge.BridgeGateLookoutWetland
(a)1 mark

Find the number of labelled points in the graph

(b)1 mark

Find the total number of joining lines, including any loop