Unit 3: Geometry and Trigonometry
Topic 3.15: Adjacency matrices (HL only) Questions
Practice 20 exam-style questions for IB Math AI SL Topic 3.15. Review the question stems below, then unlock the full Question Bank to access markschemes, model answers, and AI grading.
1Write down2 marks
2026
A bus network of three stops X, Y, Z has two-way routes X–Y and Y–Z only. Write down the adjacency matrix, taking the order X, Y, Z, and state whether it is symmetric.
Markscheme and model answer locked
Unlock Question21 mark
2026
In an undirected graph, the adjacency matrix is always:
Markscheme and model answer locked
Unlock Question31 mark
2026
A weighted (distance) matrix differs from an adjacency matrix because its entries store:
Markscheme and model answer locked
Unlock Question41 mark
2026
To count walks of length 5 between two vertices, you compute:
Markscheme and model answer locked
Unlock Question51 mark
2026
A directed graph has the arrow A→B but not B→A. In the adjacency matrix this means:
Markscheme and model answer locked
Unlock Question6Write down2 marks
2026
A directed graph has vertices A, B, C, D and E. Its directed edges are: A → C, A → D, B → A, C → B, C → C (a loop), D → E, E → B, E → C. There are no other edges.
Write down the adjacency matrix for this graph, with rows and columns in the order A, B, C, D, E.
Write down the adjacency matrix for this graph, with rows and columns in the order A, B, C, D, E.
Markscheme and model answer locked
Unlock Question7Find3 marks
2026
A council area is modelled as a square of side 60 km. The -coordinate is the distance east and the -coordinate the distance north of the origin . Four towns are modelled as points at the corners: Pinewood P, Quarrytown Q, Riverside R and Stonebridge S. A new town N has been added. A landfill site, W, is connected to the towns by a system of drainage pipes. The direct connections are given by the matrix , with rows and columns in the order (P, Q, R, S, N, W):
A 1 shows a direct connection. The 1s on the leading diagonal mean that once a location is polluted it stays polluted. A leak at W travels through the pipes, taking one day to pass between directly connected locations.
Find which town is the last to be polluted. Justify your answer.
A 1 shows a direct connection. The 1s on the leading diagonal mean that once a location is polluted it stays polluted. A leak at W travels through the pipes, taking one day to pass between directly connected locations.
Find which town is the last to be polluted. Justify your answer.
Markscheme and model answer locked
Unlock Question8Find3 marks
2026
A town has 8 roads between five junctions, A, B, C, D and E. Each road joins two junctions and can be driven in either direction. The roads join these pairs of junctions: AB, AC, AD, AE, BC, BE, CD, CE. Its adjacency matrix, with the junctions in the order A, B, C, D, E, is
$$\begin{pmatrix} 0 & 1 & 1 & 1 & 1 \\ 1 & 0 & 1 & 0 & 1 \\ 1 & 1 & 0 & 1 & 1 \\ 1 & 0 & 1 & 0 & 0 \\ 1 & 1 & 1 & 0 & 0 \end{pmatrix}$$
Hence find the number of ways to travel from junction A to junction D using exactly four roads. Roads may be repeated.
$$\begin{pmatrix} 0 & 1 & 1 & 1 & 1 \\ 1 & 0 & 1 & 0 & 1 \\ 1 & 1 & 0 & 1 & 1 \\ 1 & 0 & 1 & 0 & 0 \\ 1 & 1 & 1 & 0 & 0 \end{pmatrix}$$
Hence find the number of ways to travel from junction A to junction D using exactly four roads. Roads may be repeated.
Markscheme and model answer locked
Unlock Question9Write down2 marks
2026
A town has 7 roads between five junctions, A, B, C, D and E. Each road joins two junctions and can be driven in either direction. The roads join these pairs of junctions: AB, AC, AD, AE, BC, BE, DE.
Write down the adjacency matrix for this graph, with the junctions in the order A, B, C, D, E.
Write down the adjacency matrix for this graph, with the junctions in the order A, B, C, D, E.
Markscheme and model answer locked
Unlock Question101 mark
2026
A walk of length 4 in a graph uses how many edges and visits how many vertices (counting repeats)?
Markscheme and model answer locked
Unlock Question11Write down2 marks
2026
A directed graph has vertices A, B, C, D and E. Its directed edges are: A → B, B → C, B → D, C → A, C → E, D → D (a loop), D → E, E → A. There are no other edges.
Write down the adjacency matrix for this graph, with rows and columns in the order A, B, C, D, E.
Write down the adjacency matrix for this graph, with rows and columns in the order A, B, C, D, E.
Markscheme and model answer locked
Unlock Question12Find2 marks
2026
A directed graph has vertices P, Q, R, S, T and the following directed edges (each edge can be travelled only from the first vertex to the second).
Its adjacency matrix is , with rows and columns in the order P, Q, R, S, T (row = start vertex). It is given that , and .
Hence find an expression, in terms of where , for the number of walks of length that start at R and end at T.
| From | To |
|---|---|
| P | Q |
| P | R |
| P | S |
| Q | T |
| R | T |
| S | T |
| T | P |
Its adjacency matrix is , with rows and columns in the order P, Q, R, S, T (row = start vertex). It is given that , and .
Hence find an expression, in terms of where , for the number of walks of length that start at R and end at T.
Markscheme and model answer locked
Unlock Question13Complete2 marks
2026
The graph G has six vertices A, B, C, D, E and F. Its edges are: two edges between B and E, and one edge each for BC, CD, DE, BD, AF. There are no loops.
Complete the adjacency matrix for G, in which the entries marked … are missing.
Complete the adjacency matrix for G, in which the entries marked … are missing.
| A | B | C | D | E | F | |
|---|---|---|---|---|---|---|
| A | 0 | 0 | 0 | 0 | 0 | 1 |
| B | … | 0 | … | … | … | … |
| C | … | … | 0 | … | … | … |
| D | 0 | 1 | 1 | 0 | 1 | 0 |
| E | 0 | 2 | 0 | 1 | 0 | 0 |
| F | 1 | 0 | 0 | 0 | 0 | 0 |
Markscheme and model answer locked
Unlock Question14Determine4 marks
2026
The road links between five villages, J, K, L, M and N, are stored in an adjacency matrix, with rows and columns in alphabetical order:
$$\begin{pmatrix} 0 & 0 & 1 & 1 & 0 \\ 0 & 0 & 1 & 0 & 1 \\ 1 & 1 & 0 & 1 & 1 \\ 1 & 0 & 1 & 0 & 0 \\ 0 & 1 & 1 & 0 & 0 \end{pmatrix}$$
Determine the number of walks of length 4 which start and end at the same village.
$$\begin{pmatrix} 0 & 0 & 1 & 1 & 0 \\ 0 & 0 & 1 & 0 & 1 \\ 1 & 1 & 0 & 1 & 1 \\ 1 & 0 & 1 & 0 & 0 \\ 0 & 1 & 1 & 0 & 0 \end{pmatrix}$$
Determine the number of walks of length 4 which start and end at the same village.
Markscheme and model answer locked
Unlock Question15Determine4 marks
2026
The graph G has six vertices A, B, C, D, E and F. Its edges are: two edges between B and E, and one edge each for BC, CD, DE, BD, AF. There are no loops. The adjacency matrix of G, with rows and columns in the order A to F, is
Determine the number of walks from B to D with fewer than four edges.
Determine the number of walks from B to D with fewer than four edges.
Markscheme and model answer locked
Unlock Question16Find3 marks
2026
A directed graph has vertices A, B, C and the directed edges A → A, A → B, B → A, B → C, C → B, C → C (an edge from a vertex to itself is a loop). Its adjacency matrix, in the order A, B, C, is .
Find the total number of walks of length 6 from A to C.
Find the total number of walks of length 6 from A to C.
Markscheme and model answer locked
Unlock Question17Explain1 mark
2026
In a competition, a contestant moves through a maze from the start S to the treasure at T. The maze is modelled by a graph in which each edge is a corridor.
The corridors join: S–A, S–B (two separate corridors), A–B, A–C, A–D, B–D, B–T, C–D, C–T, D–T.
The journey is over once the treasure is reached. Using the adjacency matrix, it is found that there are 37 walks from S to T that use at most four corridors.
Explain why the number of possible journeys from S to T is less than 37.
The corridors join: S–A, S–B (two separate corridors), A–B, A–C, A–D, B–D, B–T, C–D, C–T, D–T.
The journey is over once the treasure is reached. Using the adjacency matrix, it is found that there are 37 walks from S to T that use at most four corridors.
Explain why the number of possible journeys from S to T is less than 37.
Markscheme and model answer locked
Unlock Question18State1 mark
2026
The ferry routes between five ports, A to E, are represented by a directed graph G. The adjacency matrix of G, with rows and columns in the order A, B, C, D, E, is
$$\mathbf{M} = \begin{pmatrix} 0 & 1 & 0 & 0 & 0 \\ 1 & 0 & 1 & 1 & 1 \\ 0 & 0 & 0 & 1 & 1 \\ 0 & 1 & 1 & 0 & 0 \\ 0 & 1 & 1 & 0 & 0 \end{pmatrix}$$
where a 1 in row X, column Y means there is a direct route from X to Y.
State which direct route can only be travelled in one direction.
$$\mathbf{M} = \begin{pmatrix} 0 & 1 & 0 & 0 & 0 \\ 1 & 0 & 1 & 1 & 1 \\ 0 & 0 & 0 & 1 & 1 \\ 0 & 1 & 1 & 0 & 0 \\ 0 & 1 & 1 & 0 & 0 \end{pmatrix}$$
where a 1 in row X, column Y means there is a direct route from X to Y.
State which direct route can only be travelled in one direction.
Markscheme and model answer locked
Unlock Question19Find3 marks
2026
A town has 8 roads between five junctions, A, B, C, D and E. Each road joins two junctions and can be driven in either direction. The roads join these pairs of junctions: AB, AC, AE, BC, BD, BE, CD, CE. Its adjacency matrix, with the junctions in the order A, B, C, D, E, is
$$\begin{pmatrix} 0 & 1 & 1 & 0 & 1 \\ 1 & 0 & 1 & 1 & 1 \\ 1 & 1 & 0 & 1 & 1 \\ 0 & 1 & 1 & 0 & 0 \\ 1 & 1 & 1 & 0 & 0 \end{pmatrix}$$
Hence find the number of ways to travel from junction A to junction D using exactly four roads. Roads may be repeated.
$$\begin{pmatrix} 0 & 1 & 1 & 0 & 1 \\ 1 & 0 & 1 & 1 & 1 \\ 1 & 1 & 0 & 1 & 1 \\ 0 & 1 & 1 & 0 & 0 \\ 1 & 1 & 1 & 0 & 0 \end{pmatrix}$$
Hence find the number of ways to travel from junction A to junction D using exactly four roads. Roads may be repeated.
Markscheme and model answer locked
Unlock Question20Write down2 marks
2026
A directed graph has vertices A, B, C, D and E. Its directed edges are: A → B, A → E, B → C, C → A, C → D, D → B, E → D, E → E (a loop). There are no other edges.
Write down the adjacency matrix for this graph, with rows and columns in the order A, B, C, D, E.
Write down the adjacency matrix for this graph, with rows and columns in the order A, B, C, D, E.
Markscheme and model answer locked
Unlock QuestionReady to practice Topic 3.15?
Get instant AI feedback on your answers, view detailed markschemes, and track your progress across all IB Math AI SL topics.