Step 5 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 5Follow 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.
Higher Level Applied Maths · Networks, Graphs & Matrices · Step 5 of 7
An adjacency matrix records which vertices are joined, with rows giving origins and columns giving destinations.
Reading entries accurately prevents invented connections and reversed directions in exam network questions.
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.