1

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

Correct Answer: (n*n-n-2*m)/2

Make the most of this question

This page focuses on one Data Structure (DS) question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

Data Structure (DS) MCQ: If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is | Extra Education