Which of the properties hold for the adjacency matrix of a simple undirected unweighted graph having vertices?
- AThe diagonal entries of are the degrees of the vertices of the graph.
- BIf the graph is connected, then none of the entries of can be zero.
- CIf the sum of all the elements of is at most , then the graph must be acyclic.
- DIf there is at least a 1 in each of 's rows and columns, then the graph must be connected.

