Step 4 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.Ordinary Level · Applied Maths · Networks, Graphs & Matrices · Step 4Follow the worked example and explain why each modelling and calculation step is valid.
An undirected simple graph on A,B,C has edges AB and BC. Construct its binary adjacency matrix in that order and check the sum of entries.
An undirected graph on A, B, C, with no loops or repeated edges, has edges A–B and B–C.
Construct its binary adjacency matrix M in that order. Check the sum of entries.
Ordinary Level Applied Maths · Networks, Graphs & Matrices · Step 4 of 7
A binary adjacency matrix records each connection as a 1 and each absence of a connection as a 0 in a fixed vertex order.
This representation lets you count connections and check directions using rows and columns.
An undirected graph on A, B, C, with no loops or repeated edges, has edges A–B and B–C. Construct its binary adjacency matrix M in that order. Check the sum of entries.