ISRO | ISRO CS 2008 | Question 29

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 + 1) * n/2


Answer: (B)

Explanation: A complete graph can have a maximum edges for ‘n’ nodes as each node is connected to every other node. So, for n nodes, maximum n * (n-1)/2 nodes are possible.

Option (B) is correct.

Quiz of this Question

My Personal Notes arrow_drop_up

Save