Step 7 of 7 · Worked example · TEACH
0 of 3 done
Work through the example to CHECK to open the problems.
Reach CHECK to open the problems.Higher Level · Applied Maths · Networks, Graphs & Matrices · Step 7Follow the worked example and explain why each modelling and calculation step is valid.
A directed multigraph has 2 edges from A to B, 4 from B to D, 3 from A to C and 6 from C to D, and no other edges. Parallel edges count as distinct choices. How many two-edge walks go from A to D?
A directed multigraph has 2 edges from A to B, 4 from B to D, 3 from A to C and 6 from C to D, and no other edges. Parallel edges count as distinct choices.
How many two-edge walks go from A to D?
Higher Level Applied Maths · Networks, Graphs & Matrices · Step 7 of 7
An entry of an adjacency matrix power counts walks of that length between the corresponding vertices.
In an exam, interpreting matrix entries prevents you from confusing direct edges, walks and simple paths.
A directed multigraph has 2 edges from A to B, 4 from B to D, 3 from A to C and 6 from C to D, and no other edges. Parallel edges count as distinct choices. How many two-edge walks go from A to D?