- Computer Science Engineering (CSE)
- Data Structures (DS)
- Non Linear Data Structures - Graphs
- If a simple graph G, contains n vertices...

Q. |
## 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» A. (n*n-n-2*m)/2 |

View all MCQs in:
Data Structures (DS)

- What is the number of vertices of degree 2 in a path graph having n vertices,here n>2.
- A connected planar graph having 6 vertices, 7 edges contains regions.
- Given a plane graph, G having 2 connected component, having 6 vertices, 7 edges and 4 regions. What will be the number of connected components?
- The number of edges in a regular graph of degree d and n vertices is _______.
- What is the number of edges present in a complete graph having n vertices?
- What is the maximum number of edges in a bipartite graph having 10 vertices?
- 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?
- What would the time complexity to check if an undirected graph with V vertices and E edges is Bipartite or not given its adjacency matrix?
- With V(greater than 1) vertices, how many edges at most can a Directed Acyclic Graph possess?
- The number of possible undirected graphs which may have self loops but no multiple edges and have n vertices is

Login to Continue

It will take less than 2 minutes

Report MCQ