How many undirected graphs which are not necessarily connected can be formed out of a provided set

Question:

How many undirected graphs which are not necessarily connected can be formed out of a provided set V= {V 1, V 2,…V n} of n vertices?

A. n(n-l)/2

B. 2^n

C. n!

D. 2^(n(n-1)/2)

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: