info@avatto.com
+91-9920808017
11. Sparse matrices have
many zero entries
many non-zero entries
higher dimension
none of the above
Your email address will not be published. Required fields are marked *
Report
Name
Email
Website
Save my name, email, and website in this browser for the next time I comment.
Comment
12. The minimum number of edges in a connected cyclic graph on n vertices is
n-1
n
n+1
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login
