info@avatto.com
+91-9920808017
6. A graph in which all nodes are of equal degree is called
multi graph
non regular graph
regular graph
complete graph
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
7. Maximum degree of any node in a simple graph with n vertices is
n - 1
n
n/2
n - 2
8. Two isomorphic graphs must have
same number of vertices
same number of edges
equal number of vertices
all of these
9. A given connected graph G is a Eular graph if and only if all vertices of G are of
same degree
even degree
odd degree
different degree
10. Total number of edges in a complete graph of n vertices is
[n(n-1)]/2
[n(n+1)]/2
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
