Question 9778 – Graph-Theory
February 2, 2024Programming
February 2, 2024GATE 2002
|
Question 25
|
Maximum number of edges in a n-node undirected graph without self loops is
|
n2
|
|
|
n(n-1)/2
|
|
|
n-1
|
|
|
(n+1)(n)/2
|
Question 25 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: B
Question 25 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.