On the number of minimal codewords in codes generated by the adjacency matrix of a graph