UGC NET CSE | December 2011 | Part 2 | Question: 5

Question

Maximum number of edges in a n -Node undirected graph without self loop is

• A. $n^{2}$
• B. $n(n – 1)$ 
• C. $n(n + 1)$
• D. $\frac{n(n - 1)}{2}$

Comments

$\binom{n}{2}$

Answer 1

Total no of pairs = Total no of edges (max) = $\binom{n}{2}$ = $\frac{n(n-1)}{2}$

Examples: