Search topics

Search
1 of 8 0-day streak

Count the vertices, edges and loops of a graph

DIFFICULTYintrostandardchallengeexam
QUESTION TYPEMix of allChange
vertices edges; connected sparsevertices edges; connected densevertices edges; split sparsevertices edges; split denseNOWMix of allRecommended
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: [Sale | Warragul | Yarram | Traralgon | Drouin]. Full edge list: Traralgon–Drouin; Sale–Traralgon; Drouin loop; Yarram–Warragul.SaleWarragulYarramTraralgonDrouin
(a)1 mark

Count the vertices in the graph

(b)1 mark

Count all edges in the graph