Networks and graphs: MYP maths practice
A network is a set of points joined by edges, like towns and roads or friends on a social app. You count connections, find shortest routes and decide whether a route can use every edge once. This is our own enrichment topic beyond the framework.
Opens a Skill Builder on networks and graphs: a worked example, then questions marked as you go. Free account.
What you practise
Vertices, edges and degree; Traversable networks; Shortest routes by inspection. We group it under discrete mathematics; it is our own enrichment topic, beyond the MYP framework.
Try 3 questions on networks and graphs
Have a go on paper first, then press Show me how for the worked solution.
Question 1 · No calculator · Easy
Five islands P, Q, R, S, T are linked by bridges. Each bridge is an edge: PQ, PS, QR, QS, QT, RT, ST.
- How many bridges meet at island Q? (This is the degree of Q.) [1]
- Add up the degrees of all five islands. [1]
- How many islands have an odd degree? [1]
- Degrees: P 2 (PQ, PS), Q 4 (PQ, QR, QS, QT), R 2 (QR, RT), S 3 (PS, QS, ST), T 3 (QT, RT, ST). (a) 4.
- (b)
, which is twice the 7 bridges. - (c) S and T: 2 islands.
Question 2 · No calculator · Medium
Cables can be laid between buildings P, Q, R, S, T. The possible cables and their costs (in thousands of dollars) are PQ = 6, PR = 4, QR = 3, QS = 8, RS = 5, RT = 9, ST = 7, QT = 10.
- Find the total cost of laying every possible cable. [1]
- The buildings must all be connected using the cheapest set of cables (a minimum spanning tree). Find its total cost. [3]
- (a)
. - (b) Take the cheapest cables that do not make a loop: QR 3, PR 4, RS 5; PQ 6 would make the loop P-Q-R, so skip it; ST 7 joins T. All 5 buildings are joined by 4 cables:
.
Question 3 · Calculator · Hard
A postal worker must walk along every street of this network and return to the start. Lengths in hundreds of metres: AB = 5, AC = 8, AD = 6, BC = 4, BE = 7, CD = 3, CE = 6, DE = 9.
- Find the total length of the streets. [1]
- Write the vertices of odd degree as a set, like {P, Q, R, S}. [1]
- Find the length of the shortest closed walk that uses every street at least once. [3]
- (a)
. - (b) Degrees: A 3, B 3, C 4, D 3, E 3, so
. - (c) Pair the odd vertices and repeat the shortest connecting routes. Shortest distances: AB 5, DE 9, AD 6, BE 7, AE 12 (A-B-E), BD 7 (B-C-D). Pairings: AB + DE
; AD + BE ; AE + BD . The best is 13, so the walk is .
Why it matters later
Networks lead to AI HL graph theory. See MYP to DP for the topics to secure before the Diploma.
Teachers: this topic is in our example unit Step by step: algorithms and networks (MYP 5).
Your school builds its own MYP units, so this topic may sit in a different place, or under another name, in your course. All MYP 4-5 topics
MYP practice written and checked by us. It is not IB material, and IB Math Revision is not affiliated with or endorsed by the IB.