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

Home » Programming & Data Structure » Programming and data structure miscellaneous » Question

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

1. n²
2. n(n - 1)
  2
3. n - 1
4. (n + 1)(n)
  2

Correct Option: B

Total no. of nodes = n
For an edge of n nodes we select any 2 which make a graph.
So, ⁿc₂ → n(n – 1) / 2 edges
n = 4 ; (4 × 3) / 2 = 6