info@avatto.com
+91-9920808017
1. The minimum number of edges in a connected cyclic graph on n vertices is
n -1
n
n + 1
none of these
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
2. The number of distinct simple graphs with up to three nodes is
15
10
7
9
3. A graph is planar if and only if it does not contain
sub graphs homomorpic to k3 and k33
sub graphs isomorpic to k5 or k33
sub graphs isomorpic to k3 or k33
sub graphs homomorpic to k2 and k33
4. In any undirected graph, the sum of degrees of all the nodes
must be even
is twice the number of edges
must be ODD
need not be EVEN
5. Number of vertices of ODD degree in a graph is
always EVEN
always ODD
either EVEN or ODD
always ZERO
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
