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.Higher 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.
Higher Level Applied Maths · Networks, Graphs & Matrices · Step 4 of 7
A binary adjacency matrix records which pairs of vertices are connected, using a fixed row and column order.
Accurate matrix entries prevent direction errors and make degree checks straightforward in exam questions.
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.