General Maths · Topic quiz
Graphs and networks quiz
10 questions across the topic, from foundation to complex unfamiliar, the way the exam mixes them. You see how you went at the end, with a worked solution for every question.
Difficulty
- 29 min on the clock: the working time each question needs. The quiz ends when time is up.
- Have your calculator ready: some questions may be technology-active.
- Multiple choice, short response, graph interpretation and worked response. Answer in any order and change answers until you finish.
What it covers
- Graph vocabulary
- Degrees of vertices
- Types of graphs
- Drawing network diagrams
- Adjacency matrices
- Planar graphs and faces
- Euler's formula
- Walks, trails, paths and cycles
- Shortest paths by trial and error
- Eulerian trails and circuits
- Hamiltonian paths and cycles
Each quiz is drawn fresh, so taking it again gives new questions. Your results update your mastery for this topic.
Revise first
The quiz draws on all 8 lessons in Graphs and networks, and the 16 worked examples show the same kinds of questions solved step by step.
- Graphs, vertices, edges and degreeRead a graph as vertices joined by edges, find the degree of every vertex — counting a loop twice — and use the sum of the degrees to count edges.
- Types of graphs and network diagramsRecognise complete, bipartite, directed and weighted graphs, and construct a network diagram for a real situation such as walking tracks, a social network, one-way streets or a round-robin.
- Adjacency matricesStore a graph or digraph as an adjacency matrix, read degrees and edge counts from the matrix, and draw the graph that a matrix describes.
- Planar graphs and Euler's formulaDecide whether a graph is planar by redrawing it without crossings, count its faces, and use Euler's formula to find a missing count or test a claim.
- Walks, trails, paths, circuits and cyclesDescribe routes through a graph precisely — walks, trails and paths, open or closed, circuits and cycles — and recognise connected graphs and bridges.
- Shortest paths by trial and errorFind the shortest path between two vertices of a weighted graph by listing the possible routes systematically, totalling each, and choosing the least.
- Eulerian trails and circuitsUse the degrees of the vertices to decide whether a graph is Eulerian, semi-Eulerian or neither, find Eulerian trails and circuits, and solve route problems that must cover every edge.
- Hamiltonian paths and cyclesFind routes that visit every vertex exactly once, decide whether a graph is Hamiltonian or semi-Hamiltonian, and find the shortest Hamiltonian cycle in a small network by trial and error.