Vidyalelo
Data Structure · Q101

Graphs

Programming · Data Structure · question 101

Q101

If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is . . . . . . . .

A.
(n*n-n-2*m)/2
Answer
B.
(n*n+n+2*m)/2
C.
(n*n-n-2*m)/2
D.
(n*n-n+2*m)/2

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board