Q. If a simple graph G, contains n vertices and m edges, the number of edges in the GraphG'(Complement of G) is (Solved)
1. (n*n-n-2*m)/2
2. (n*n+n+2*m)/2
3. (n*n-n-2*m)/2
4. (n*n-n+2*m)/2
- a. (n*n-n-2*m)/2
1. (n*n-n-2*m)/2
2. (n*n+n+2*m)/2
3. (n*n-n-2*m)/2
4. (n*n-n+2*m)/2