Year 12 Standard Maths Introduction to Networks 3

JavaScript isn't enabled in your browser, so this file can't be opened. Enable and reload.

Name *

School

Country *

A network contains 50 vertices. How many edges are required to form a spanning tree?

1 point

Clear selection

The following network shows the length, in kilometres, of roads connecting nine villages. A programme of resurfacing some roads is undertaken to ensure that each village can access all other villages along a resurfaced road. Using a minimum spanning tree, what length of road, in kilometres, will connect all nine villages while keeping the amount of road to be resurfaced to a minimum?

1 point

66.9

67.6

67.9

69.1

Clear selection

A network of four points A, B, C and D is drawn below. Which of the following diagrams is NOT an equivalent graph of the network above?

1 point

Clear selection

A collection of bushwalking tracks is modelled by the network below. There are 6 lookout points, labelled A, B, C, D, E and F. Which two edges should be removed so that a bushwalker can walk along every track exactly once and still visit every lookout?

1 point