15 Graph Theory [83 marks]

The above diagram shows the weighted graph G.

1a. Write down the adjacency matrix for G. [1 mark]

1b. Find the number of distinct walks of length 4 beginning and ending at A. [3 marks]

1c. Starting at A, use Prim’s algorithm to find and draw the minimum [5 marks]
spanning tree for G.
Your solution should indicate clearly the way in which the tree is constructed.

2. The diagram below shows a weighted graph. [6 marks]

Use Prim’s algorithms to find a minimal spanning tree, starting at J. Draw the tree,
and find its total weight.
 Let G be a weighted graph with 6 vertices L, M, N, P, Q, and R. The weight of the
edges joining the vertices is given in the table below:

For example the weight of the edge joining the vertices L and N is 3.

3a. Use Prim’s algorithm to draw a minimum spanning tree starting at M. [5 marks]

3b. What is the total weight of the tree? [1 mark]

4. The distances by road, in kilometres, between towns in Switzerland are [5 marks]

shown in the following table.

A cable television company wishes to connect the six towns placing cables along
the road system.
Use Kruskal’s algorithm to find the minimum length of cable needed to connect
the six towns.
 A canal system divides a city into six land masses connected by fifteen bridges, as
shown in the diagram below.

5a. Draw a graph to represent this map. [2 marks]

5b. Write down the adjacency matrix of the graph. [2 marks]

5c. List the degrees of each of the vertices. [2 marks]

State with reasons whether or not this graph has

5d. an Eulerian circuit. [2 marks]

5e. an Eulerian trail. [2 marks]

5f. Find the number of walks of length 4 from E to F. [2 marks]

Consider the following weighted graph G.

6a. State what feature of G ensures that G has an Eulerian trail. [1 mark]
6b. State what feature of G ensures that G does not have an Eulerian circuit. [1 mark]

6c. Write down an Eulerian trail in G. [2 marks]

6d. Starting and finishing at B, find a solution to the Chinese postman [3 marks]
problem for G.

6e. Calculate the total weight of the solution. [1 mark]

The adjacency matrix of the graph G, with vertices P, Q, R, S, T is given by:

P Q R S T
P ⎛0 2 1 1 0⎞
Q ⎜
⎜
2 1 1 1 0⎟
⎟
⎜
⎜ 2⎟
⎟
⎜ ⎟
R 1 1 1 0
S ⎜1 1 0 0 0⎟
⎝0 0 2 0 0⎠
T

7a. Draw the graph of G. [3 marks]

7b. Define an Eulerian circuit. [1 mark]

7c. Write down an Eulerian circuit in G starting at P. [2 marks]

7d. Define a Hamiltonian cycle. [2 marks]

7e. Explain why it is not possible to have a Hamiltonian cycle in G. [3 marks]

7f. Find the number of walks of length 5 from P to Q. [4 marks]

7g. Which pairs of distinct vertices have more than 15 walks of length 3 [4 marks]
between them?
 A driver needs to make deliveries to five shops A, B, C, D and E. The driver
starts and finishes his journey at the warehouse W . The driver wants to find the
shortest route to visit all the shops and return to the warehouse. The distances, in
kilometres, between the locations are given in the following table.

8a. By deleting W , use the deleted vertex algorithm to find a lower bound [6 marks]
for the length of a route that visits every shop, starting and finishing at
W.

8b. Starting from W , use the nearest-neighbour algorithm to find a route [4 marks]
which gives an upper bound for this problem and calculate its length.

Let G be the graph below.

9a. Find a minimum spanning tree for the subgraph obtained by deleting A [3 marks]
from G.

9b. Hence, find a lower bound for the travelling salesman problem for G. [3 marks]

9c. Give an upper bound for the travelling salesman problem for the graph [2 marks]
above.
© International Baccalaureate Organization 2021
International Baccalaureate® - Baccalauréat International® - Bachillerato Internacional®

Printed for INTL PROGRAMS SCH-AL KHOBAR