Kizspy | Question: 7 (Choose 1 answer)
Let G be a simple graph. The complementary graph of G is the simple graph G' having the same set of vertices, and there is an edge connecting u and v in G' if and only if there is no edge connecting u and v in G.
If G has v vertices and e edges, how many edges does G' have?
A. None of the other choices is correct
B. e
C. v(v-1)/2-e+1
D. v(v-1)/2-e
Ε. v
