+1 vote
in Data Structures & Algorithms I by (88.2k points)
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

(b) (n*n+n+2*m)/2

(c) (n*n-n-2*m)/2

(d) (n*n-n+2*m)/2

My query is from Graph topic in section Graph of Data Structures & Algorithms I

This question was addressed to me in my homework.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Right choice is (a) (n*n-n-2*m)/2

For explanation: The union of G and G’ would be a complete graph so, the number of  edges in G’= number of edges in the complete form of G(nC2)-edges in G(m).

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.