The maximum number of edges in a n-node undirected graph without self loops is

ISRO Scientist/Engineer SC · 2016 · Computer Science· Modified — slightly modified from the official paper; see the solutionGATE · 2002 · CS · Question 1 subpartsISRO Scientist/Engineer SC · 2008 · Computer Science

1. A.

   n2

2. B.

   n(n-1)/2

3. C.

   n-1

4. D.

   n(n+1)/2

Attempted by 1207 students.

The worked solution is available to enrolled students.