Q51
Given an adjacency matrix A = [ [0, 1, 1], [1, 0, 1], [1, 1, 0] ], The total no. of ways in which every vertex can walk to itself using 2 edges is . . . . . . . .
A.
2
B.
4
C.
6
AnswerD.
8
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board