Networks/graph theory

Explore some of the different types of network, and prove a result about network trees.

Explore creating 'factors and multiples' graphs such that no lines joining the numbers cross

Look for the common features in these graphs. Which graphs belong together?

Think about the mathematics of round robin scheduling.

Imagine you had to plan the tour for the Olympic Torch. Is there an efficient way of choosing the shortest possible route?

How many different colours would be needed to colour these different patterns on a torus?

Given probabilities of taking paths in a graph from each node, use matrix multiplication to find the probability of going from one vertex to another in 2 stages, or 3, or 4 or even 100.

Given the graph of a supply network and the maximum capacity for flow in each section find the maximum flow across the network.