Scribd
Upload
100 views13 pages

Graph Theory 1

The document contains a series of graph theory problems involving calculations related to vertices, edges, and paths in various graphs, including undirected graphs representing boat routes and tourist attractions. It requires finding expressions for distances, costs, and travel times, as well as applying algorithms like Prim's and the nearest neighbour algorithm. Additionally, it explores properties of planar graphs and their complements, focusing on vertices and edges.

Uploaded by

Aiibe C
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
100 views13 pages

Graph Theory 1

The document contains a series of graph theory problems involving calculations related to vertices, edges, and paths in various graphs, including undirected graphs representing boat routes and tourist attractions. It requires finding expressions for distances, costs, and travel times, as well as applying algorithms like Prim's and the nearest neighbour algorithm. Additionally, it explores properties of planar graphs and their complements, focusing on vertices and edges.

Uploaded by

Aiibe C
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/ 13

Graph theory [59 marks]

1. [Maximum mark: 5] 24M.1.AHL.TZ1.8


The weights on the following graph represent the lengths of different roads in
kilometres.

(a) Write down the vertices with odd degree. [1]

The total length of the roads is 33 + x km.

(b) Find two expressions, in terms of x, for the shortest distance


required to walk along all of the paths, beginning and ending
at the same vertex.
Include in your answer the interval of values of x for which
each expression is valid. [4]

2. [Maximum mark: 18] 23N.2.AHL.TZ0.5


The following diagram is a map of a group of four islands and the closest
mainland. Travel from the mainland and between the islands is by boat. The
scheduled boat routes between the ports A, B, C, D and E are shown as
dotted lines on the map.
Let the undirected graph G represent the boat routes between the ports A, B,
C, D and E.

(a) Draw graph G. [1]

(b) Graph G can be represented by an adjacency matrix P , where


the rows and columns represent the ports in alphabetical order.

(b.i) 0 1 2 4 1
⎛ ⎞
1 2 5 a 2

Given that P 3 = 2 5 4 6 5 , find the value of a.


4 a 6 4 6

⎝ ⎠
1 2 5 6 2 [2]

(b.ii) Hence, write down the number of different ways that someone
could start at port B and end at port C, using three boat route
journeys. [1]

(c) Find a possible Eulerian trail in G , starting at port A. [2]


The cost of a journey on the different boat routes is given in the following table;
all prices are given in USD. The cost of a journey is the same in either direction
between two ports.

Sofia wants to make a trip where she travels on each of the boat routes at least
once, beginning and ending at port A.

(d) Find the minimum cost of Sofia’s trip. [3]

The boat company decides to add an additional boat route to make it possible to
travel on each boat route exactly once, starting and ending at the same port.

(e.i) Identify between which two ports the additional boat route
should be added. [1]

(e.ii) Determine the cost of the additional boat route such that the
overall cost of the trip is the same as your answer to part (d). [1]

The boat company plans to redesign which ports are connected by boat routes.
Their aim is to have a single boat trip that visits all the islands and minimizes the
total distance travelled, starting and finishing at the mainland, A.

The following table shows the distances in kilometres between the ports A, B,
C, D and E.
(f.i) Use the nearest neighbour algorithm to find an upper bound
for the minimum total distance. [3]

(f.ii) Use the deleted vertex algorithm on port A to find a lower


bound for the minimum total distance. [4]

3. [Maximum mark: 25] 21N.3.AHL.TZ0.1


This question explores how graph algorithms can be applied to a graph with
an unknown edge weight.

Graph W is shown in the following diagram. The vertices of W represent tourist


attractions in a city. The weight of each edge represents the travel time, to the
nearest minute, between two attractions. The route between A and F is
currently being resurfaced and this has led to a variable travel time. For this
reason, AF has an unknown travel time x minutes, where x ∈ Z .
+
(a) Write down a Hamiltonian cycle in W . [1]

Daniel plans to visit all the attractions, starting and finishing at A. He wants to
minimize his travel time.

To find a lower bound for Daniel’s travel time, vertex A and its adjacent edges
are first deleted.

(b.i) Use Prim’s algorithm, starting at vertex B, to find the weight of


the minimum spanning tree of the remaining graph. You should
indicate clearly the order in which the algorithm selects each
edge. [5]
(b.ii) Hence, for the case where x < 9, find a lower bound for
Daniel’s travel time, in terms of x. [2]

Daniel makes a table to show the minimum travel time between each pair of
attractions.
Write down the value of

(c.i) p. [1]

(c.ii) q. [1]

(c.iii) r. [1]

To find an upper bound for Daniel’s travel time, the nearest neighbour algorithm
is used, starting at vertex A.

Consider the case where x = 3.


(d.i) Use the nearest neighbour algorithm to find two possible
cycles. [3]

(d.ii) Find the best upper bound for Daniel’s travel time. [2]

Consider the case where x > 3.

(e.i) Find the least value of x for which the edge AF will definitely
not be used by Daniel. [2]
(e.ii) Hence state the value of the upper bound for Daniel’s travel
time for the value of x found in part (e)(i). [2]

(f ) The tourist office in the city has received complaints about the
lack of cleanliness of some routes between the attractions.
Corinne, the office manager, decides to inspect all the
routes between all the attractions, starting and finishing at H.
The sum of the weights of all the edges in graph W is
(92 + x).

Corinne inspects all the routes as quickly as possible and takes


2 hours.

Find the value of x during Corinne’s inspection. [5]


4. [Maximum mark: 11] 20N.3.AHL.TZ0.Hdm_5
G is a simple, connected, planar graph with 9 vertices and e edges.

(a) Find the maximum possible value of e. [2]


The complement of G has e′ edges.

(b) Find an expression for e′ in terms of e. [2]

(c) Given that the complement of G is also planar and connected,


find the possible values of e. [2]

(d) H is a simple graph with v vertices and e edges.

Given that both H and its complement are planar and


connected, find the maximum possible value of v. [5]
© International Baccalaureate Organization, 2025

You might also like