Exclusive to AI HL, graph theory introduces the mathematical study of networks. Students work with simple, complete, weighted and directed graphs, and understand key terminology including degree, subgraphs and trees. Adjacency matrices connect this content directly to the matrices subtopic. Algorithms are central: students apply Kruskal's and Prim's algorithms for minimum spanning trees, and tackle the Chinese postman and travelling salesman problems using the nearest neighbour and deleted vertex algorithms to find upper and lower bounds on optimal routes.
Start here
Start by downloading the cheat sheet and the vocabulary below. After that, move to the video lessons with their respective exercise lists.
Video lessons
Learn the content with the videos provided and reinforce your comprehension by practicing with the exercise list above.
Take the mock exams
It’s time to put your knowledge to the test with our mock exams — the closest experience you’ll get to the real IB Math exams. Note: read the instructions on taking mock exams here.
Join our Discord group
Learn from and collaborate with your peers. Coming soon. Join the waitlist here.
