info@avatto.com
+91-9920808017
0. Consider a simple connected graph G with n vertices and n edges (n > 2). Then which of the following statements are TRUE?
G has no cycles.
G has atleast one cycle.
Graph obtained by removing any edge from G is not connected.
None of these
You must be logged in to post a comment.
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
You must be logged in to post a comment.