How many simple undirected graphs, not necessarily connected, can be…
How many simple undirected graphs, not necessarily connected, can be constructed on the fixed vertex set V = {v1, v2, ..., vn}?
- A.
n(n - 1) / 2
- B.
2n
- C.
n!
- D.
2n(n - 1) / 2
Attempted by 504 students.
Sign up free to check your answer
Sign up freeLoading lesson…