Scribd
Upload
19 views5 pages

2021 Graph Theory Test

Uploaded by

104472
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
19 views5 pages

2021 Graph Theory Test

Uploaded by

104472
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

MAI HL 12: Mar 2021 Graph Theory

Name:________________________________ 57 min + 3 reading time 51 points

Unless otherwise stated in the question, all numerical answers should be given exactly or correct to three
significant figures.

1. A series of 7 wind farms are to be constructed and the estimated cost in thousands of Euros, of
laying electrical cables between the different wind farms is shown in the graph below.

a. Construct the table for this graph. [2]


b. Using the table or the graph, apply Prim’s algorithm to the weighted graph to obtain the
minimal spanning tree starting with the wind farm A. (marks will only be awarded if you
show the correct application of the required algorithms, and show all your working) [7]
c. What is the minimum cost of laying the electrical cables? [1]
2. At the local gym there are four exercise machines, A, B, C and D. Trainers run various circuit
training and as a result follow different paths from different machines as shown in the graph.

a. Create the transition matrix for this graph. [2]

b. Determine the steady state matrix. [2]

c. Based upon the steady state matrix which machine would you expect to need servicing
first, second, third and last? [2]
3. Consider the graph G represented in the following
diagram.

a. State, with a reason, whether or not G has an Eulerian circuit. [1]

b. Use Kruskal’s algorithm to find a minimum spanning tree for G, stating its total weight.
Indicate clearly the order in which the edges are added. [4]

c. Find the minimum time it takes Mr José to patrol the resort if he has to walk along every
road at least once, starting and ending at A. State clearly which roads need to be repeated.
[7]
4. The cost adjacency matrix below represents the distance in kilometres, along routes between bus
stations.

All the values in the matrix are positive, distinct integers.

It is decided to electrify some of the routes, so that it will be possible to travel from any station to
any other station solely on electrified routes. In order to achieve this with a minimal total length of
electrified routes, Prim’s algorithm for a minimal spanning tree is used, starting at vertex A.

The algorithm adds the edges in the following order:

AB AC CD DE.

There is only one minimal spanning tree.

a. Find with a reason, the value of x. [2]


b. If the total length of the minimal spanning tree is 14, find the value of s. [2]
c. Hence, state, with a reason, what can be deduced about the values of p, q, r. [2]
5. The following table shows the costs in US dollars (US$) of direct flights between six cities. Blank
cells indicate no direct flights. The rows represent the departure cities. The columns represent the
destination cities.

a. Show the direct flights between the cities as a graph. [2]

b. Write down the adjacency matrix for this graph. [2]

c. Using your answer to part (b), find the number of different ways to travel from and return to
city A in exactly 6 flights. [2]

d. State whether or not it is possible to travel from and return to city A in exactly 6 flights,
having visited each of the other 5 cities exactly once. Justify your answer. [2]

The following table shows the least cost to travel between the cities.

e. Find the values of a and b. [2]

A travelling salesman has to visit each of the cities, starting and finishing at city A.

f. Use the nearest neighbour algorithm to find an upper bound for the cost of the trip. [3]

g. By deleting vertex A, use the deleted vertex algorithm to find a lower bound for the cost of
the trip. [4]

You might also like