adplus-dvertising
frame-decoration

Question

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

Answer: (c).(n*n-n-2*m)/2

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

Q. Which of the following properties does a simple graph not hold?

Q. What is the maximum number of edges in a bipartite graph having 10 vertices?

Q. Which of the following is true?

Q. For a given graph G having v vertices and e edges which is connected and has no cycles, which of the following statements is true?

Q. For which of the following combinations of the degrees of vertices would the connected graph be eulerian?

Q. A graph with all vertices having equal degree is known as a __________

Q. Which of the following ways can be used to represent a graph?

Q. The number of elements in the adjacency matrix of a graph having 7 vertices is __________

Q. What would be the number of zeros in the adjacency matrix of the given graph?

Q. Adjacency matrix of all graphs are symmetric.

Q. The time complexity to calculate the number of edges in a graph whose information in stored in form of an adjacency matrix is ____________

Q. For the adjacency matrix of a directed graph the row sum is the _________ degree and the column sum is the ________ degree.

Q. What is the maximum number of possible non zero values in an adjacency matrix of a simple graph with n vertices?

Q. On which of the following statements does the time complexity of checking if an edge exists between two particular vertices is not, depends?

Q. In the given connected graph G, what is the value of rad(G) and diam(G)?

Q. Which of these adjacency matrices represents a simple graph?

Q. Given an adjacency matrix A = [ [0, 1, 1], [1, 0, 1], [1, 1, 0] ], how many ways are there in which a vertex can walk to itself using 2 edges.

Q. If A[x+3][y+5] represents an adjacency matrix, which of these could be the value of x and y.

Q. Two directed graphs(G and H) are isomorphic if and only if A=PBP-1, where P and A are adjacency matrices of G and H respectively.

Q. Given the following adjacency matrix of a graph(G) determine the number of components in the G.

[0 1 1 0 0 0],

[1 0 1 0 0 0],

[1 1 0 0 0 0],

[0 0 0 0 1 0],

[0 0 0 1 0 0],

[0 0 0 0 0 0].