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

PYQ GATE 2002

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

  1. A.

    n2

  2. B.

    n(n-1)/2

  3. C.

    n-1

  4. D.

    n(n+1)/2

Attempted by 1555 students.

Sign up free to check your answer

Sign up free

Explore the full course: Data Structures

Loading lesson…