Question

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

• A. $n^2$
• B. n(n - 1)/2
• C. n - 1
• D. (n + 1) (n)/2

Answer 1

The correct option is B n(n - 1)/2

The graph containing maximum number of edge in a n node undirected graph without self loop is complete graph.

The number of edges in complete graph with n node, $k_{n}is\frac{n(n-1)}{2}.$