Lesson 3: Adjacency matrices
Drawing a digraph from its adjacency matrix
SkillsAdjacency matricesDrawing network diagrams
Worked example
Four netball teams — Kelvin Grove (), Mitchelton (), Nundah () and Sandgate () — played a round-robin. In the matrix, the entry in row , column is 1 if team beat team .
(a) Draw the digraph of the results.
(b) How many games were played?
(c) Which teams won the most games?
Step 1: Draw the vertices
One vertex for each team: , , and .
Step 2: Turn each 1 into an arrow from the row team to the column team
Row gives arrows and . Row gives and . Row gives . Row gives .
Rows are "from" and columns are "to". A 1 in row , column means beat , so the arrow points from to .
Step 3: Count the games
Each 1 is one game: games. Check: a round-robin of 4 teams has games. ✓
Step 4: Find the most wins
The row sums are the wins: 2, 2, 1, 1. Kelvin Grove and Mitchelton each won 2 games.
Answer
(a) Arrows , , , , and . (b) 6 games. (c) Kelvin Grove and Mitchelton, with 2 wins each.
Try a similar one
A fresh question of the same kind, checked as you answer, with hints and a full solution.
Method
Draw one vertex for each row label.
Digraph: an entry in row , column means arrows from to .
Graph without arrows: read the entries on and above the leading diagonal; each is that many edges, and a diagonal entry is a loop.
Watch out for
Drawing the arrows from the column team to the row team, which reverses every result.
Putting arrowheads at both ends — that would mean each team beat the other.