For a simple undigraph with n vertices and e edges, which of the following argument for its adjacency matrix A is wrong: 对于包含n个顶点e条边的简单无向图，以下关于它的邻接矩阵A的说法中错误的是：
AA has n rows and e columns, where the elements take a value of {0, 1} A有n行e列，其中元素取值于{0, 1}
BThe number of 1 in the kth row of A is equal to the degree of vertex k A的第k行中1的个数等于顶点k的度
CA=AT
DThe element in row A and column V in A is 1 if and only if vertex u is associated with vertex v A中位于第u行v列的元素为1当且仅当顶点u和顶点邻接