ISRO Computer Science (CSE) 2008 - Question 30

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

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

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

Answer: B. n(n-1)/2

Explanation: This is a complete graph Kn.

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