Lesson 7: Communication and road networks
Who should start the phone tree?
SkillsNetworks and communicationPowers of matrices
Worked example
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.
Step 1: Write the communication matrix
Order Priya, Quinn, Rosa, Sam, Tom; rows send, columns receive:
Step 2: Square it with technology
Step 3: Add to count one or two steps
An element of that is not 0 means the sender can reach that receiver directly or through one other person.
Step 4: Find the rows with no zeros off the diagonal
Ignoring the diagonal: Priya's row is and Sam's row is — no zeros. Quinn cannot reach Rosa, Rosa cannot reach Priya, and Tom cannot reach Quinn or Rosa in two steps.
So only Priya or Sam could start the phone tree.
Step 5: Recommend one
Priya's row adds to 5 and Sam's to 4, so Priya's message has more routes (two different ways to reach Quinn). If one call fails, her message is a little more likely to get through, so Priya is the better choice. Either meets the two-step requirement.
Answer
Only Priya and Sam can reach every other member in at most two steps (their rows of have no zeros off the diagonal). Priya is recommended because her message has the most routes.
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
Write the communication matrix from the diagram.
Use technology for , then find .
A row with no zeros off the diagonal reaches everyone in one or two steps.
Use the numbers of routes to compare the options and justify a choice.
Watch out for
Using only : 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.