Ordinary Level Applied Maths

Networks, Graphs & Matrices

7 Steps · all open

Start at Step 1
  1. Step 1OpenNetworks as Mathematical ModelsA network models objects as vertices, connections as edges or directed arcs, and quantities such as travel time as weights.
  2. Step 2OpenVertices, Edges, Weights, Paths & CyclesVertices are points, edges are connections, weights are values attached to edges, a simple path repeats no vertex, and a cycle returns to its start without repeating other vertices.
  3. Step 3Full accessDirected, Undirected, Connected & Disconnected GraphsArrow directions determine permitted travel, while connectivity describes which vertices are joined by paths.
  4. Step 4Full accessBuilding an Adjacency MatrixA binary adjacency matrix records each connection as a 1 and each absence of a connection as a 0 in a fixed vertex order.
  5. Step 5Full accessReconstructing Networks from MatricesAn adjacency matrix records connections between vertices using row-to-column entries.
  6. Step 6Full accessMatrix MultiplicationMatrix multiplication forms each entry by multiplying matching values in a row of the first matrix and a column of the second, then adding the products.
  7. Step 7Full accessInterpreting Matrix Products & Multiple RepresentationsAn entry of an adjacency matrix squared counts two-edge walks between the corresponding vertices, including walks that repeat vertices.