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

The network shown is used for this question. Vertices are labelled locations and edges are direct connections

Unweighted network. Vertices in listed order: [F | B | C | D | A]. Full edge list: D–A; C–A; F–A.FBCDA
1 mark

Select the graph type justified by the network