Search topics

Search
1 of 8 0-day streak

Graph types, subgraphs, connection models and method selection

DIFFICULTYintrostandardchallengeexam
QUESTION TYPEMix of allChange
A simple graph with no isolated vertex and not all possible edgesA graph with an isolated vertex and at least one edgeA degenerate graph with no edgesNOWMix of allRecommended
Question 1 of 8

No calculator

Consider the following unweighted network. Vertices represent locations in roads between Gippsland towns, and edges show direct connections

Unweighted network. Vertices in listed order: [Moe | Bairnsdale | Drouin | Traralgon]. Full edge list: Bairnsdale–Traralgon; Drouin–Traralgon.MoeBairnsdaleDrouinTraralgon
1 mark

Select the graph type justified by the network