Step 5 of 7 · Worked example · TEACH

← Networks, Graphs & Matrices

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 5

Follow the worked example and explain why each modelling and calculation step is valid.

Vertices are ordered A,B,C. The binary adjacency matrix is [[0,1,0],[1,0,1],[0,1,0]]; a row-to-column 1 denotes a permitted edge. List the edges and classify the graph.

Vertices are ordered A, B, C. The binary adjacency matrix, row by row, is

(0, 1, 0), (1, 0, 1), (0, 1, 0).

A 1 from row to column means a permitted edge. List the edges and classify the graph.

Read it once, slowly. Then copy it onto your page.
  • What is given? Rows and columns both run A, B, C. Nine entries, each 0 or 1: a binary adjacency matrix.
  • How do I read an entry? Row to column: the row is where you start, the column is where you go. A 1 means that move is allowed.
  • What do they want? The edges, listed. Then classify the graph: directed or undirected, and any loops.
Céim

Higher Level Applied Maths · Networks, Graphs & Matrices · Step 5 of 7

Reconstructing Networks from Matrices

An adjacency matrix records which vertices are joined, with rows giving origins and columns giving destinations.

Why it matters

Reading entries accurately prevents invented connections and reversed directions in exam network questions.

The worked example

Vertices are ordered A, B, C. The binary adjacency matrix, row by row, is (0, 1, 0), (1, 0, 1), (0, 1, 0). A 1 from row to column means a permitted edge. List the edges and classify the graph.

How the worked example goes

  1. Read

    • What is given? Rows and columns both run A, B, C. Nine entries, each 0 or 1: a binary adjacency matrix.
    • How do I read an entry? Row to column: the row is where you start, the column is where you go. A 1 means that move is allowed.
    • What do they want? The edges, listed. Then classify the graph: directed or undirected, and any loops.
  2. Understand

    • How do I picture it?
    • From (row) → to (columns A, B, C)
    • A: [0 1 0]
  3. Reduce

    • Row B is (1, 0, 1). What does it say? B to A and B to C: Row B has 1s in columns A and C: B to A, and B to C.
    • Where do I start?
    • Go row by row and write each 1 as a move. Then pair the moves up, then look at the diagonal.
  4. Solve

    • Read every row.
    • Row A (0, 1, 0): A to B.
    • Row B (1, 0, 1): B to A, and B to C.
  5. Check

    • Is it right?
    • Rebuild from A–B, B–C
    • [0 1 0]