Lesson 3: Adjacency matrices

Drawing a digraph from its adjacency matrix

SkillsAdjacency matricesDrawing network diagrams

Worked example

  • Simple familiar

Four netball teams — Kelvin Grove (KK), Mitchelton (MM), Nundah (NN) and Sandgate (SS) — played a round-robin. In the matrix, the entry in row ii, column jj is 1 if team ii beat team jj.

KMNSK0110M0011N0001S1000\begin{array}{c|cccc} & K & M & N & S \\ \hline K & 0 & 1 & 1 & 0 \\ M & 0 & 0 & 1 & 1 \\ N & 0 & 0 & 0 & 1 \\ S & 1 & 0 & 0 & 0 \end{array}

(a) Draw the digraph of the results.

(b) How many games were played?

(c) Which teams won the most games?

1 of 4 steps
  1. Step 1: Draw the vertices

    One vertex for each team: KK, MM, NN and SS.

Try a similar one

A fresh question of the same kind, checked as you answer, with hints and a full solution.

Method

  1. Draw one vertex for each row label.

  2. Digraph: an entry aa in row ii, column jj means aa arrows from ii to jj.

  3. 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.

Save your progress with a free account