UGC NET CS 2011 Dec-Paper-2

Question 5

Maximum number of edges in a n-Node undirected graph without self loop is

Question 5 Explanation:

The set of vertices has size n, the number of such subsets is given by the binomial coefficient C(n,2)⋅C(n,2) = n(n-1)/2

Correct Answer: D

Question 5 Explanation:

The set of vertices has size n, the number of such subsets is given by the binomial coefficient C(n,2)⋅C(n,2) = n(n-1)/2