Two-step routes and matrix powers
A connection matrix records direct connections in a fixed vertex order. Its square is found by matrix multiplication, and each entry of C squared counts routes that use exactly two connections
- Use the square for two steps Use the square of a connection matrix for routes with two connections and the cube for routes with three connections \(\displaystyle C^{2}=C \times C,\qquad C^{3}=C \times C \times C\)
- Pair a row with a column For one entry of C squared, pair the matching entries in a row of C and a column of C \(\displaystyle \left(C^{2}\right)_{ij}=c_{i1}c_{1j}+c_{i2}c_{2j}+c_{i3}c_{3j}\)
- Count each intermediate Each product represents routes through one intermediate vertex, and the products are added \(\displaystyle 1 \times 2+2 \times 1+1 \times 0=4\)
- Read a leading diagonal entry A leading diagonal entry of C squared counts routes that start and end at the same vertex after exactly two connections. If a loop is present, the intermediate vertex may be the starting vertex \(\displaystyle \left(C^{2}\right)_{11}=2 \times 2+0 \times 0+1 \times 1=5\)
Worked example
The connection matrix for vertices P, Q and R is shown below. Find the number of two-step routes from P to R
- \(\displaystyle \text{row }1(C)=(0,1,1),\qquad \text{column }3(C)=\begin{bmatrix}1\\1\\0\end{bmatrix}\)Use the row for P and the column for R
- \(\displaystyle \left(C^{2}\right)_{13}=0 \times 1+1 \times 1+1 \times 0\)Multiply corresponding entries from the selected row and column
- \(\displaystyle \left(C^{2}\right)_{13}=0+1+0=1\)Adding the three products gives the number of two-step routes from P to R
Common mistakes
Difficulty levels
Questions about this topic
Why does C squared count two-step routes?+
For a selected start and end, each term in the row-by-column product chooses one intermediate vertex. The product counts the two connections through that vertex, and adding the terms counts all such routes
What does a leading-diagonal entry of C squared mean?+
It counts routes that start and end at that vertex after exactly two connections. Vertices or connections may be revisited, and a loop can make the intermediate vertex the starting vertex. It does not count a single direct connection by itself
Why can a two-step entry be greater than 1?+
Different intermediate vertices can give different routes. Parallel direct connections also create separate routes, so a connection matrix records their multiplicity
Can I use a calculator?+
No. This topic is practised without a calculator
Which year level and chapter is this?+
Year 12, VCE Units 3 & 4, General Mathematics, chapter 10: Matrices