Practice this skill
Start with a worked example, try the application questions and then use the checkpoint to see what to practise next.
Use this skill in later work
See how this foundation skill supports the following topics.
General Mathematics
- Unit 1 · Interpret simple matrices representing communication links.
- Unit 1 · Construct a population transition matrix whose process has an equilibrium.
- Unit 2 · Understand graph types, planar structure, adjacency matrices and traversal terminology.
- Unit 2 · Understand weighted networks and the shortest-path problem.
- Unit 2 · Explain trees, minimum spanning trees and greedy selection.
- Unit 2 · Count a planar graph’s faces, vertices and edges and apply Euler’s relation.
- Unit 2 · Model traversal problems using trails, paths, circuits, bridges and cycles.
- Unit 2 · Find a shortest path by inspection in a weighted graph.
- Unit 2 · Solve minimum-connector problems using trees and greedy methods.
- Unit 2 · Construct graphs, directed graphs, networks and corresponding matrices for a situation.
- Units 3–4 · Interpret communication and dominance matrices.
- Units 3–4 · Connect transition diagrams, matrices and regularity.
- Units 3–4 · Convert between a transition matrix, transition diagram and verbal description.
- Units 3–4 · Understand graph types, adjacency matrices and planar Euler relationships.
- Units 3–4 · Understand travelling and exploring problems and Eulerian or Hamiltonian traversal.
- Units 3–4 · Understand minimum connectors, spanning trees and Prim’s procedure.
- Units 3–4 · Understand capacities, cuts and the maximum-flow minimum-cut relationship.
- Units 3–4 · Understand shortest paths and Dijkstra’s procedure.
- Units 3–4 · Understand assignment and the Hungarian procedure.
- Units 3–4 · Understand scheduling networks and critical-path analysis.
- Units 3–4 · Construct a practical graph, directed graph or network and its matrix representation.
- Units 3–4 · Solve travelling or exploring problems using the appropriate traversal concepts.
- Units 3–4 · Solve minimum-connector problems by inspection or Prim’s algorithm.
- Units 3–4 · Model and solve flow problems using inspection or maximum-flow/minimum-cut reasoning.
- Units 3–4 · Solve shortest-path problems by inspection or Dijkstra’s algorithm.
- Units 3–4 · Solve assignment problems by inspection or the Hungarian algorithm.
- Units 3–4 · Solve scheduling problems using critical-path analysis.
- Units 3–4 · Recognise the standard models and where they can be applied.
- Units 3–4 · Choose matrix or network methods for an extended contextual investigation.
Specialist Mathematics
- Unit 1 · Know graph terminology, representations, families and structural properties
- Unit 1 · Recognise how graphs model problems and how suitable graphs are constructed
- Unit 1 · Know elementary graph results and their proofs
- Unit 1 · Construct graph models for given situations
- Unit 1 · Use algorithms to build graph subsets satisfying conditions and solve associated problems
- Unit 1 · Develop and explain graph results about planarity, trails and circuits
- Unit 1 · Solve graph problems and prove related theorems