Question

The vertex connectivity of any tree is

• A. One
• B. Two
• C. Three
• D. None of the above

Answer 1

The correct option is A

One

Explanation for the correct option:

• Vertex connectivity is defined as the smallest number of vertices whose deletion causes a connected graph to not be connected.
• This is the minimum number of vertices needed to remove to make the graph not strongly connected.
• So, the vertex connectivity of any tree is one because whenever we remove one vertex from a tree it becomes disconnected.

Hence the correct option is option(A).