Check the starting point
- Multiply matrices in row-by-column order.
- Interpret the chosen origin/destination convention.
Show the idea
Direct and two-step communication
Rows describe origins. There is one two-step walk A→B→C, so entry (A,C) of the squared adjacency matrix is 1.
Work through an example
A=. Find
.
- An entry of
counts two-step walks under the stated adjacency convention. To find row 1, column 3, use row 1 of A and column 3 of A.
- Row 1 is (0,1,1) and column 3 is (1,1,0). Their dot product is 0×1+1×1+1×0=1.
- The non-zero contribution comes through vertex 2: 1→2→3. There is exactly one such two-step walk.
Answer: 1.
Teach in small steps
- Read the visual model together: Rows describe origins. There is one two-step walk A→B→C, so entry (A,C) of the squared adjacency matrix is 1.
- Model this example aloud: Transpose
. Guide: The first column of the transpose is the first row of the original; dimensions change from 2×3 to 3×2. Result:
.
- Let your learner choose the steps for a new situation: An adjacency matrix in order A,B,C is
, with rows as origins. Find
and interpret entry (1,3). Ask which part of the model or rule carries over before checking the worked solution.
- After a short break, ask for an independent response: Find the determinant of
and state whether an inverse exists. Compare both the method and conclusion with the checkpoint answers, then revisit any misconception.
Ask and listen
- For
=2i−j, form the 2×3 matrix with indices starting at 1.
- In a simple undirected graph, vertex P has degree 4. What is the P,P entry of the squared adjacency matrix?
Adapt the practice
More support
Start with this prerequisite: Multiply matrices in row-by-column order. Keep the visual visible. For the first guided problem, focus on this step: The first column of the transpose is the first row of the original; dimensions change from 2×3 to 3×2.
More challenge
Try this application without looking at its answer: A dominance matrix is D=. Rank by row sums of D+
. Then explain why the answer fits the stated domain or context.
Look for understanding
- Your learner can complete this checkpoint and explain the method: Find the determinant of
and state whether an inverse exists.
- Your learner can justify or challenge this statement/question using the mathematical definitions: In a simple undirected graph, vertex P has degree 4. What is the P,P entry of the squared adjacency matrix?
Choose the next step
If either checkpoint needs prompting, repeat the worked model with changed values and revisit this caution: Entries of a squared adjacency matrix count two-step walks, not just direct links. When both are secure, use the linked Apply and extend resource and relevant VCE Key Knowledge/Key Skills activity.
Put the idea into practice
The matching topic collection includes learn-and-practise, application and checkpoint PDFs with worked answers. Download the free preview to see representative pages.
Explore this topic’s worksheets