If a simple graph G, contains n vertices and m edges, the num-
ber of edges in the Graph G’(Complement of G) is
(i) (n ∗ n − n − 2 ∗ m)/2
(ii) (n ∗ n + n + 2 ∗ m)/2
(iii) (n ∗ n − n − 2 ∗ m)/2
(iv) (n ∗ n − n + 2 ∗ m)/2
Answers
Answered by
0
Answer:
(iv) ( n∗ n+n+2*m)3
Step-by-step explanation:
fie orrj84e
Similar questions