General Mathematics · Unit 4 · Graphs and networks
Worked examples
16 worked examples, each solved step by step with the reasoning behind every move. Try one yourself first, then reveal the working.
Lesson 1Graphs, vertices, edges and degree
Open the lesson- Degrees in a graph with a loop and multiple edgesSimple familiarWith or without technologyDegrees of verticesGraph vocabulary
- Using the sum of the degreesComplex familiarWith or without technologyDegrees of vertices
Lesson 2Types of graphs and network diagrams
Open the lesson- A round-robin competition as a complete graphSimple familiarWith or without technologyTypes of graphsDrawing network diagrams
- Drawing a network of walking tracksSimple familiarWith or without technologyDrawing network diagramsTypes of graphs
Lesson 3Adjacency matrices
Open the lesson- Constructing an adjacency matrixSimple familiarWith or without technologyAdjacency matrices
- Drawing a digraph from its adjacency matrixSimple familiarWith or without technologyAdjacency matricesDrawing network diagrams
Lesson 4Planar graphs and Euler's formula
Open the lesson- Counting faces and verifying Euler's formulaSimple familiarWith or without technologyEuler's formulaPlanar graphs and faces
- Planning garden paths with Euler's formulaComplex unfamiliarWith or without technologyEuler's formulaDegrees of vertices
Lesson 5Walks, trails, paths, circuits and cycles
Open the lesson- Walk, trail, path, circuit or cycle?Simple familiarWith or without technologyWalks, trails, paths and cycles
- Finding the bridges in a road networkComplex familiarWith or without technologyWalks, trails, paths and cycles
Lesson 6Shortest paths by trial and error
Open the lesson- Shortest route from Cairns to AthertonSimple familiarWith or without technologyShortest paths by trial and error
- When the shortest path uses more edgesComplex familiarWith or without technologyShortest paths by trial and error
Lesson 7Eulerian trails and circuits
Open the lesson- Eulerian, semi-Eulerian or neither?Simple familiarWith or without technologyEulerian trails and circuits
- Planning a street sweeper's routeComplex unfamiliarWith or without technologyEulerian trails and circuitsShortest paths by trial and error
Lesson 8Hamiltonian paths and cycles
Open the lesson- A vet's round trip — the shortest Hamiltonian cycleComplex familiarWith or without technologyHamiltonian paths and cycles
- A dead-end road makes a graph semi-HamiltonianComplex familiarWith or without technologyHamiltonian paths and cycles