Consider the following undirected graph G:
What would the adjacency matrix for G be like?

Question

Consider the following undirected graph G:  What would the adjacency matrix for G be like?

Answer

M = \begin{bmatrix}0 & 1 & 0 & 0 & 1 \1 & 0 & 1 & 1 & 1 \0 & 1 & 0 & 1 & 0 \0 & 1 & 1 & 0 & 1 \1 & 1 & 0 & 1 & 0 \end{bmatrix}

Answer

M = \begin{bmatrix}0 & 1 & 0 & 1 & 0 \0 & 0 & 1 & 1 & 1 \0 & 1 & 0 & 1 & 0 \0 & 1 & 1 & 0 & 1 \1 & 1 & 0 & 1 & 0 \end{bmatrix}

Answer

M = \begin{bmatrix}0 & 0 & 0 & 1 & 0 \0 & 0 & 1 & 1 & 1 \0 & 1 & 0 & 1 & 0 \0 & 1 & 0 & 0 & 1 \1 & 1 & 0 & 1 & 0 \end{bmatrix}

Crowdly