Which of the following statements is/are TRUE regarding adjacency matrices…

1. A.

   Any graph G can be represented using fewer bits of space with an adjacency matrix than with adjacency lists.

2. B.

   It is often faster to add and remove edges from G when using an adjacency matrix.

3. C.

   With adjacency matrices, iterating over all neighbours incident to a vertex v requires only O(v.δ(v)) time, where δ(v) is the degree of v

4. D.

   None of these

Attempted by 377 students.