How many undirected graphs (not necessarily connected) can be constructed out…

GATE · 2001 · CS · Question 2 subparts

How many undirected graphs (not necessarily connected) can be constructed out of a given set V = {v₁, v₂, …, vₙ} of n vertices?

  1. A.

    n(n - 1) / 2

  2. B.

    2n

  3. C.

    n!

  4. D.

    2n(n - 1) / 2

Attempted by 54 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…