- Computer Science Engineering (CSE)
- Data Structures (DS)
- Non Linear Data Structures - Graphs
- With V(greater than 1) vertices, how man...

Q. |
## With V(greater than 1) vertices, how many edges at most can a Directed Acyclic Graph possess? |

A. | (V*(V-1))/2 |

B. | (V*(V+1))/2 |

C. | (V+1)C2 |

D. | (V-1)C2 |

Answer» A. (V*(V-1))/2 |

View all MCQs in:
Data Structures (DS)

- If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is
- What is the value of the sum of the minimum in-degree and maximum out-degree of an Directed Acyclic Graph?
- What is the number of vertices of degree 2 in a path graph having n vertices,here n>2.
- What is the number of edges present in a complete graph having n vertices?
- A connected planar graph having 6 vertices, 7 edges contains regions.
- 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?
- 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?
- 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?
- The number of edges in a regular graph of degree d and n vertices is _______.

Login to Continue

It will take less than 2 minutes

Report MCQ