info@avatto.com
+91-9920808017
16. Number of different rooted labeled trees with n vertices is
2n-1
2n
nn-1
nn
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
17. Minimum number of colours required to colour the vertices of a cycle with n nodes in such a way that no two adjacent nodes have the same colour is
2
3
4
n 2|n/2| + 2
18. Maximum number of edges in a n-node undirected graph without self loops is
n2
[n(n-1)]/2
n-1
[n(n+1)]/2
19. Let G be a graph with 100 vertices numbered 1 to 100. Two vertices i and j are adjacent if Ii - j I = 8 or Ii - j I = 12. The number of connected components in G is
8
12
25
20. 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
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
