ISRO Computer Science (CSE) 2013 - Question 76

All ISRO Computer Science (CSE) papers | ISRO Computer Science (CSE) 2013

The number of edges in a 'n' vertex complete graph is

  • A. n*(n-1)/2
  • B. n²
  • C. n*(n+1)/2
  • D. n * (n + 1)

Answer: A. n*(n-1)/2

Explanation: Complete graph $K_n$ has $\binom{n}{2}$ edges.

| | All questions of ISRO Computer Science (CSE) 2013