Search topics

Search
1 of 8 0-day streak

Graph types, subgraphs, connection models and method selection

DIFFICULTYintrostandard
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 represent locations in paths between campus buildings, and edges show direct connections

Unweighted network. Vertices in listed order: [Library | Science | Arts | Workshop | Canteen | Gym]. Full edge list: Library–Gym; Science–Arts; Canteen–Science; Arts–Gym.LibraryScienceArtsWorkshopCanteenGym
1 mark

Select the graph type justified by the network