Unit 3: Geometry and Trigonometry

Topic 3.14: Graph theory (HL only) Questions

Practice 20 exam-style questions for IB Math AI SL Topic 3.14. Review the question stems below, then unlock the full Question Bank to access markschemes, model answers, and AI grading.

11 mark
2026
A 'path' through a graph is a route that:
Markscheme and model answer locked
Unlock Question
21 mark
2026
In a graph, the degree of a vertex is:
Markscheme and model answer locked
Unlock Question
3Write down1 mark
2026
Six towns are joined by roads. The towns are the vertices A, B, C, D, E and H of a weighted graph, and the lengths of the roads, in kilometres, are shown in the table. A maintenance team has its base at H and must inspect every road.

RoadLength
HA11
HC14
AB9
AE16
BC12
BD15
CD10
CE13
DE8

Write down the degree of H.
Markscheme and model answer locked
Unlock Question
4State1 mark
2026
Six sorting points are joined by streets. The points are the vertices K, L, M, N, P and Q of a weighted graph, and the lengths of the streets, in hundreds of metres, are shown in the table. A maintenance team has its base at M and must inspect every road.

RoadLength
KN17
KL12
KM9
LN14
LP18
MN11
MP16
MQ7
NP10
NQ8

The team plan to travel along each road exactly once, starting and ending at M.

State a reason why this plan is not possible.
Markscheme and model answer locked
Unlock Question
5Explain2 marks
2026
A weighted graph has vertices for five towns: Ashby (A), Bexley (B), Carden (C), Dalton (D), Eston (E). Each edge weight is the fare, in pounds, of the cheapest direct train between two towns. The edges are listed below.

EdgeWeight
AC76
AD57
AE47
BC38
BD39
BE37
CD42
CE70
DE88

Explain why the graph can be described as "connected", but not "complete".
Markscheme and model answer locked
Unlock Question
6State1 mark
2026
A delivery driver must visit six warehouses, A, B, C, D, E and F. The roads between some pairs of warehouses, with their lengths in kilometres, are listed.

RoadABACADBCBECDCFDEDFEF
Length (km)1422301025122791611

State, with a reason, whether the graph contains an Eulerian circuit.
Markscheme and model answer locked
Unlock Question
7Explain2 marks
2026
A weighted graph has vertices for five islands: Arne (A), Brava (B), Corro (C), Dunmore (D), Elsby (E). Each edge weight is the fare, in euros, of the cheapest direct ferry between two islands. The edges are listed below.

EdgeWeight
AB92
AC55
AD32
AE39
BC93
BD54
BE94
CD43
DE33

Explain why the graph can be described as "connected", but not "complete".
Markscheme and model answer locked
Unlock Question
8Find2 marks
2026
A water-supply network is connected, has 12 junctions and is a tree (no loops/cycles).

(a) Find the number of pipes (edges).
(b) Explain what removing one pipe does to the supply.
Markscheme and model answer locked
Unlock Question
9Find3 marks
2026
A computer network connects 6 servers with these cables: 1–2, 1–3, 2–3, 3–4, 4–5, 4–6, 5–6. Find the degree of each server, and verify the handshake lemma.
Markscheme and model answer locked
Unlock Question
10Determine2 marks
2026
Seven towns, A to G, are joined by roads. The table lists each road and its length in kilometres; there are no other roads.

RoadABACADBDBFCDCEDEDFEFEGFG
Length (km)116119108983111718

Determine whether it is possible to make a journey that starts and finishes at different towns and uses every road exactly once. Give a reason for your answer.
Markscheme and model answer locked
Unlock Question
11State1 mark
2026
Six towns are joined by roads. The towns are the vertices A, B, C, D, E and H of a weighted graph, and the lengths of the roads, in kilometres, are shown in the table. A maintenance team has its base at H and must inspect every road.

RoadLength
HA11
HC14
AB9
AE16
BC12
BD15
CD10
CE13
DE8

The team plan to travel along each road exactly once, starting and ending at H.

State a reason why this plan is not possible.
Markscheme and model answer locked
Unlock Question
12Determine2 marks
2026
Seven villages, A to G, are joined by roads. The table lists each road and its length in kilometres; there are no other roads.

RoadABADAEBCBDCDCFCGDEDFEFEG
Length (km)7131471014813101049

Determine whether it is possible to make a journey that starts and finishes at different villages and uses every road exactly once. Give a reason for your answer.
Markscheme and model answer locked
Unlock Question
13Write down1 mark
2026
The graph W has vertices A, B, C, D, E, F, G and H, which represent delivery depots in a region. The weight of each edge is the driving time, to the nearest minute, between two of them. The road between A and F is being repaired, so edge AF has an unknown weight minutes, where . The edges of W are listed below; there are no other edges.

EdgeTime (minutes)
AB5
AF
AG13
BC4
BD9
CD6
CH10
DE7
DH5
EF8
EG11
FG4
FH12
GH6

Write down a Hamiltonian cycle in W.
Markscheme and model answer locked
Unlock Question
14Write down1 mark
2026
A company has six offices, A, B, C, D, E and F. A manager plans to visit every office. The roads between some pairs of offices, with their lengths in kilometres, are listed.

RoadABAEAFBCBECDCEDEDFEF
Length (km)19331523111626133120

Write down a Hamiltonian cycle for this graph.
Markscheme and model answer locked
Unlock Question
15State2 marks
2026
The table shows the costs, in euros, of ferry crossings between six islands A, B, C, D, E and F. A blank cell means there is no direct connection. The rows show the departure point and the columns the destination.

From \ ToABCDEF
A6080
B6011045
C1108512095
D8570
E8045120
F9570

State whether or not it is possible to travel from A and return to A using exactly 6 direct connections, visiting each of the other five places exactly once. Justify your answer.
Markscheme and model answer locked
Unlock Question
16State2 marks
2026
The table shows the costs, in GBP, of direct train tickets between six towns A, B, C, D, E and F. A blank cell means there is no direct connection. The rows show the departure point and the columns the destination.

From \ ToABCDEF
A4075
B4055
C6550
D75556590100
E509080
F10080

State whether or not it is possible to travel from A and return to A using exactly 6 direct connections, visiting each of the other five places exactly once. Justify your answer.
Markscheme and model answer locked
Unlock Question
17Write down1 mark
2026
The graph W has vertices A, B, C, D, E, F, G and H, which represent museums in a city. The weight of each edge is the travel time by tram, to the nearest minute, between two of them. The tram line between A and F is being repaired, so edge AF has an unknown weight minutes, where . The edges of W are listed below; there are no other edges.

EdgeTime (minutes)
AB4
AF
AH12
BC5
BH8
CD7
CE11
DE4
DG9
EF10
EG6
FG7
FH9
GH5

Write down a Hamiltonian cycle in W.
Markscheme and model answer locked
Unlock Question
18Explain2 marks
2026
A weighted graph has vertices for five depots: Alder (A), Birch (B), Cedar (C), Dogwood (D), Elm (E). Each edge weight is the driving time, in minutes, of the quickest direct road between two depots. The edges are listed below.

EdgeWeight
AB74
AC46
AD31
AE66
BD90
BE69
CD83
CE33
DE72

Explain why the graph can be described as "connected", but not "complete".
Markscheme and model answer locked
Unlock Question
19Find2 marks
2026
In an island group, travel between five ports, A, B, C, D and E, is by ferry. There is one direct route between each of these pairs of ports, and no others: A and C; B and C; B and D; C and D; C and E; D and E. Let the undirected graph represent the routes.

Find a possible Eulerian trail in starting at port A.
Markscheme and model answer locked
Unlock Question
20Write down1 mark
2026
A network of paths joins the points A, B, C, D and E. The paths and their lengths are listed below, where .

PathLength (km)
AB6
AE5
BE4
CD3
CE8
DE2
BC

Write down the vertices with odd degree.
Markscheme and model answer locked
Unlock Question

Ready to practice Topic 3.14?

Get instant AI feedback on your answers, view detailed markschemes, and track your progress across all IB Math AI SL topics.