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

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

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).
Bissoy MCQ

Related Questions

The line graph L(G) of a simple graph G is defined as follows: There is exactly one vertex v(e) in L(G) for each edge e in G. For any two edges e and e' in G, L(G) has an edge between v(e) and v(e'), if and only if e and e' are incident with the same vertex in G. Which of the following statements is/are TRUE? (P) The line graph of a cycle is a cycle. (Q) The line graph of a clique is a clique. (R) The line graph of a planar graph is planar. (S) The line graph of a tree is a tree.
What is the number of vertices in an undirected connected graph with 39 edges, 7 vertices of degree 2, 2 vertices of degree 5 and remaining of degree 6?
An undirected graph has 8 vertices labelled 1, 2, …,8 and 31 edges. Vertices 1, 3, 5, 7 have degree 8 and vertices 2, 4, 6, 8 have degree 7. What is the degree of vertex 8?
The number of faces, vertices and edges of a polyhydron A are x, 10 and 15, respectively and the number of faces, vertices and edges of a polyhydron B are 12, y and 30, respectively. What is the value of (x + y)?
A complete bipartite graph is a one in which each vertex in set X has an edge with set Y. Let n be the total number of vertices. For maximum number of edges, the total number of vertices hat should be present on set X is?
Suppose a database schedule 5 involves transactions T1, T2, .............Tn Consider the precedence graph of S with vertices representing the transactions and edges representing the conflicts. If S is serializable, which one of the following orderings of the vertices of the precedence graph is guaranteed to yield a serial schedule ?
Suppose a database schedule S involves transactions T1, …,Tn. Construct the precedence graph of S with vertices representing the transactions and edges representing the conflicts. If S is serializable, which one of the following orderings of the vertices of the precedence graph is guaranteed to yield a serial schedule? 
Which one of the following code is correct showing number of vertices, edges and Diameter for the given network ?     Vertices Edges Diameter A. 10 7 5 B. 10 10 7 C. 10 5 6 D. 10 8 7
Which of the following is/are not true for a triangular pyramid? (a) Triangular pyramid has six faces. (b) Triangular pyramid has four vertices. (c) Triangular pyramid has six edges. (d) The sum of the number of faces, vertices and edges of a triangular pyramid is 14. (e) Triangular pyramid is also known as a tetrahedron.
A ______ is a graph which has the same number of edges as its complement must have number of vertices congruent to 4m or 4m modulo 4(for integral values of number of edges).