Loading…
Loading…
IB Maths AI · Graph theory
Practice questions on graph theory, from the basics up to exam level, each with a full worked solution. Try one online now, or work through the list below on paper and open the solution to check your working.
Answer a real practice question. Get it wrong and MugCorner shows you where it went wrong, with hints and a step-by-step guide.
Find the number of edges of the simple graph with this adjacency matrix:
Each row's 1s: the degree of that vertex
Free account
Everything on this page stays free. An account is where graph theory practice starts adding up.
| Browsing | Account | |
|---|---|---|
| Read the notes and print worksheets and papers | ✓ | ✓ |
| Try a question with marking, hints and the step guide | ✓ | ✓ |
| Endless questions on every chapter, at every level | – | ✓ |
| Levels that unlock as you improve | – | ✓ |
| Your mistakes tracked by type, so you see what keeps costing marks | – | ✓ |
| WA practice papers on the chapters being tested | – | ✓ |
| Revision reminders before a topic fades | – | ✓ |
| Progress page and leaderboards | – | ✓ |
Find the number of edges of the simple graph with this adjacency matrix:
Find the number of walks of length from A to C in the graph with this adjacency matrix:
Does the connected graph shown have an Eulerian circuit, an Eulerian trail (but no circuit), or neither?
Use Kruskal's algorithm to find the total weight of a minimum spanning tree of the graph with these edge weights ("" means no edge):
Find the total weight of the shortest route that travels along every edge of the weighted graph shown at least once and returns to its start (the Chinese postman problem).