\( \definecolor{colordef}{RGB}{249,49,84} \definecolor{colorprop}{RGB}{18,102,241} \)
Consider the undirected graph \(K\) given by the following adjacency matrix (vertices are ordered alphabetically: X, Y, Z):$$ \mathbf{M} = \begin{pmatrix}0 & 1 & 1 \\ 1 & 0 & 1 \\ 1 & 1 & 0\end{pmatrix} $$
  1. Draw the undirected graph \(K\).
  2. Find the number of walks of length 2 from vertex X to vertex Y.
  3. Find the number of walks of length 3 from vertex Y to vertex Z.

Capture an image of your work. AI teacher feedback takes approximately 10 seconds.