1 of 8 0-day streak

Construct and analyse relation matrices

Question 1 of 8

No calculator

A network for towns joined by direct roads is shown. Each arrow shows a one-way link from its first vertex to its second vertex

All entries and route counts are exact whole numbers; no rounding is used

Use the vertex order Echuca, Ararat, Bendigo, Colac for the rows and columns of \(C\). Rows name the source vertex and columns name the target vertex

Complete the marked entries

Rows, in order: Echuca, Ararat, Bendigo, Colac

Columns, in order: Echuca, Ararat, Bendigo, Colac

C = \begin{bmatrix} \square & 1 & \square & \square \\ 1 & 0 & \square & \square \\ 0 & 1 & \square & \square \\ 1 & 0 & 1 & \square \end{bmatrix}