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:
- A.
Biconnected graph
- B.
Separable graph
- C.
Forest
- D.
Digraph
Attempted by 69 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.