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:

  1. A.

    Biconnected graph

  2. B.

    Separable graph

  3. C.

    Forest

  4. D.

    Digraph

Attempted by 397 students.

Sign up free to check your answer

Sign up free

Explore the full course: Coal India Management Trainee

Loading lesson…