Sparse matrices have
many zero entries
many non-zero entries
higher dimension
none of the above
Option: A
Explanation :
Click on Discuss to view users comments.
Write your comments here:
The minimum number of edges in a connected cyclic graph on n vertices is
n-1
n
n+1
Option: B
Do not have an account? Register
