If a connected graph G does not contain any vertex whose removal disconnects…
PYQ Coal India Management Trainee CBT 2017Modified — slightly modified from the official paper; see the solution
If a connected graph G does not contain any vertex whose removal disconnects the rest of the graph, then G is called:
- A.
Biconnected graph
- B.
Separable graph
- C.
Forest
- D.
Digraph
Attempted by 397 students.
Sign up free to check your answer
Sign up freeLoading lesson…

