Discrete Math Help Needed with Question 8a For the accompany

Discrete Math: Help Needed with Question 8(a)

For the accompanying graph, let A be the adjacency matrix. Compute A^2 two ways: Directly. By counting visually the number of paths of length 2 between each pair of vertices. For the graph in [7] List all paths of length 4 between mu and omega. (The simplest way to record your answer is to denote each path by its vertex sequence. For instance one such path is mu nu omega mu omega.) Check your answer using the adjacency matrix.

Solution

a) These are the lengths of path 4

Length of Path 4 - (uvwuw, uvwxw, uwvuw}

Hence there will be only 3 possible paths of length 4 that can exists in this graph since we have exhauseted all the neigbhours of u and w in this process