- Computer Science Engineering (CSE)
- Data Structures (DS)
- Non Linear Data Structures - Graphs
- For the given graph(G), which of the fol...

Q. |
## For the given graph(G), which of the following statements is true? |

A. | G is a complete graph |

B. | G is not a connected graph |

C. | The vertex connectivity of the graph is 2 |

D. | none |

Answer» C. The vertex connectivity of the graph is 2 |

View all MCQs in:
Data Structures (DS)

- 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?
- Which of the given statement is true?
- Given an empty AVL tree, how would you construct AVL tree when a set of numbers are given without performing any rotations?
- Which of the following statements for a simple graph is correct?
- How many of the following statements are correct?
- Which of the following is true?
- Which of the following is true?
- If there are more than 1 topological sorting of a DAG is possible, which of the following is true.
- Which of the following is true?
- Which of the following is true for the LSD radix sort?

Login to Continue

It will take less than 2 minutes

Report MCQ