Question:

The vertex connectivity of any tree is

Show Hint

Trees are minimally connected graphs with vertex connectivity 1.
Updated On: Apr 7, 2026
  • one
  • two
  • three
  • None of these
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is A

Solution and Explanation

Step 1: Understanding the Concept:
Vertex connectivity is the minimum number of vertices whose removal disconnects the graph.
Step 2: Detailed Explanation:
A tree has at least one leaf (vertex of degree 1). Removing a leaf does not disconnect the tree. However, removing a cut vertex (articulation point) disconnects it. The vertex connectivity of any tree is 1.
Step 3: Final Answer:
One.
Was this answer helpful?
0
0

Top MET Questions

View More Questions