bendlogan8044 bendlogan8044 10-04-2024 Mathematics contestada 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 (d) 8