Discrete Maths - Graphs

Avatto > > GATE COMPUTER SCIENCE > > Practice Questions > > Engineering Maths > > Discrete Maths > > Graphs

16. Number of different rooted labeled trees with n vertices is

Answer
Comment
Array

Option : C
Explanation :

You must be logged in to post a comment.

You must be logged in to post a 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

Answer
Comment
Array

Option : B
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

18. Maximum number of edges in a n-node undirected graph without self loops is

Answer
Comment
Array

Option : B
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

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

Answer
Comment
Array

Option : B
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

20. Consider a simple connected graph G with n vertices and n edges (n > 2). Then which of the following statements are TRUE?

Answer
Comment
Array

Option : B,C
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

Related Quiz.
Graphs

Forgot your password?

I agree with the Terms.