Question

5. Suppose we are given an unweighted, directed graph G with n vertices (labelled 1 to n), and let M be the n × n adjacency matrix for G (that is, M (i,j-1 if directed edge (1J) is in G and 0 otherwise). a. Let the product of M with itself (M2) be defined, for 1 S i,jS n, as follows where "." is the Boolean and operator and "+" is the Boolean or operator. Given this definition what does M2(i,j) 1 imply about verti What if M2 (i,j)0? ces i and i? b. Suppose M4 is the product of M2 with itself. What do the entries of M4 signify? What about M for any 1 Sks n?

Answer 1

Joexplain clefail. let take an Example 0 m is an adjacency matuix tou 4 Given Condiion sdae -> lpven 0 ทั้(เ,,)-@oỳm('') t (n (เมิ.m(2.))+(m(1,3).m(3,)

23녀 So, here we obsevved that n(ij): 1 ohen extケ8;heded.ed9eA from there rn2 (1.3) = 1 . it mean, that we ar having path ㎡ (,j): o ''t mearw that there might be a path betwee') i ond jt Length is not s. tohenev, here is no Path, we get rn"(i,j)-。 Here there is path ut length is 3. -H exe, m [1,5) is d, 't mean, that there exish poth rom to ith length y. , ang vetces a)3, 4, are not havingport emar other Vehcev with dength ee exi s