If a simple graph G, contains n vertices and m edges, the number of edges in the GraphG'(Complement of G) is
A. (n*n-n-2*m)/2
B. (n*n+n+2*m)/2
C. (n*n-n-2*m)/2
D. (n*n-n+2*m)/2
Answer:A
If a simple graph G, contains n vertices and m edges, the number of edges in the GraphG'(Complement of G) is
A. (n*n-n-2*m)/2 B. (n*n+n+2*m)/2 C. (n*n-n-2*m)/2 D. (n*n-n+2*m)/2