The maximum number of edges in a n-node undirected graph without self loops is
The correct answer is ∞, but if we assume that the graph is Simple (i.e self-loop and parallel edges are disallowed) then the ans will be (b) n(n-1)/2 .
For maximum no of edges we must have one edge for each pair of vertices.
We can select a pair out of N nodes in NC2 ways = N(N-1)/2
Given $C$ program is not