ISRO | ISRO CS 2016 | Question 3

The maximum number of edges in a n-node undirected graph without self loops is
(A) n²
(B) n(n-1)/2
(C) n-1
(D) n(n+1)/2


Answer: (B)

Explanation:

Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up

Save