Lesson 7: Communication and road networks

Who should start the phone tree?

SkillsNetworks and communicationPowers of matrices

Worked example

  • Complex unfamiliar
  • Technology active

A sports club committee passes urgent news along a phone tree. The arrows show who has whose number.

The committee wants one person to start every message, so that it reaches all the other members in at most two steps. Use matrices to determine who could start the phone tree, and recommend one person.

1 of 5 steps
  1. Step 1: Write the communication matrix

    Order Priya, Quinn, Rosa, Sam, Tom; rows send, columns receive:

    K=[0110000010010011000100010]K = \begin{bmatrix} 0 & 1 & 1 & 0 & 0 \\ 0 & 0 & 0 & 1 & 0 \\ 0 & 1 & 0 & 0 & 1 \\ 1 & 0 & 0 & 0 & 1 \\ 0 & 0 & 0 & 1 & 0 \end{bmatrix}

Try a similar one

A fresh question of the same kind, checked as you answer, with hints and a full solution.

Who can call whom on the committee.

Method

  1. Write the communication matrix from the diagram.

  2. Use technology for K2K^2, then find K+K2K + K^2.

  3. A row with no zeros off the diagonal reaches everyone in one or two steps.

  4. Use the numbers of routes to compare the options and justify a choice.

Watch out for

  • Using only K2K^2: it misses direct calls, so Priya → Quinn would look like it needs a go-between.

  • Reading columns instead of rows: columns show who can reach a person, not who that person can reach.

Save your progress with a free account