If a connected graph G does not contain any vertex whose removal disconnects…

2017

If a connected graph G does not contain any vertex whose removal disconnects the rest of the graph, then G is called:

Answer: A. Biconnected graph — The correct option is A. A vertex whose removal disconnects a graph is called an articulation point (or cut vertex). A connected graph that contains no…

  1. A.

    Biconnected graph

  2. B.

    Separable graph

  3. C.

    Forest

  4. D.

    Digraph

Attempted by 219 students.

Show answer & explanation

Correct answer: A

The correct option is A.
A vertex whose removal disconnects a graph is called an articulation point (or cut vertex). A connected graph that contains no articulation points is defined as a biconnected graph, meaning it remains connected even after removing any single vertex.

Explore the full course: Iocl Engineers Officers Grade A Paper 2

Loading lesson…