
Find the vertex connectivity of any tree.
A. One
B. Two
C. Three
D. None of the above
Answer
162.9k+ views
Hint: First recall the definition of vertex connectivity of a tree and the definition of a tree, then answer the given question.
Complete step by step solution:
The vertex connectivity of a graph G is the minimum number of vertices whose removal disconnects G.
Now, a tree is an undirected connected graph in which two vertices are connected by exactly one path.
For example let us draw a tree,

Image: Tree
Now, from the image we can see that if we remove the edge of vertex 1 and 2 then the graph becomes disconnected also if we remove the edge of vertex 2 and 3 this also makes the graph disconnected.
Therefore, the removal of one vertex makes the graph disconnected.
Hence, the vertex connectivity of a tree is always one.
The correct option is A.
Note: Sometimes students draw a tree and shows that when they remove one vertex the graph got disconnected. This is also a good approach to answer this question.
For example,

Image: Tree
This diagram is of a tree.
But, if we remove any one edge, suppose we are removing the edge of the vertices 1, 2. Then the graph becomes

Image: Tree
This is not a connected graph, therefore this is not a tree.
Hence, the vertex connectivity of a tree is 1.
Complete step by step solution:
The vertex connectivity of a graph G is the minimum number of vertices whose removal disconnects G.
Now, a tree is an undirected connected graph in which two vertices are connected by exactly one path.
For example let us draw a tree,

Image: Tree
Now, from the image we can see that if we remove the edge of vertex 1 and 2 then the graph becomes disconnected also if we remove the edge of vertex 2 and 3 this also makes the graph disconnected.
Therefore, the removal of one vertex makes the graph disconnected.
Hence, the vertex connectivity of a tree is always one.
The correct option is A.
Note: Sometimes students draw a tree and shows that when they remove one vertex the graph got disconnected. This is also a good approach to answer this question.
For example,

Image: Tree
This diagram is of a tree.
But, if we remove any one edge, suppose we are removing the edge of the vertices 1, 2. Then the graph becomes

Image: Tree
This is not a connected graph, therefore this is not a tree.
Hence, the vertex connectivity of a tree is 1.
Recently Updated Pages
If there are 25 railway stations on a railway line class 11 maths JEE_Main

Minimum area of the circle which touches the parabolas class 11 maths JEE_Main

Which of the following is the empty set A x x is a class 11 maths JEE_Main

The number of ways of selecting two squares on chessboard class 11 maths JEE_Main

Find the points common to the hyperbola 25x2 9y2 2-class-11-maths-JEE_Main

A box contains 6 balls which may be all of different class 11 maths JEE_Main

Trending doubts
JEE Main 2025 Session 2: Application Form (Out), Exam Dates (Released), Eligibility, & More

JEE Main 2025: Derivation of Equation of Trajectory in Physics

Displacement-Time Graph and Velocity-Time Graph for JEE

Degree of Dissociation and Its Formula With Solved Example for JEE

Electric Field Due to Uniformly Charged Ring for JEE Main 2025 - Formula and Derivation

JoSAA JEE Main & Advanced 2025 Counselling: Registration Dates, Documents, Fees, Seat Allotment & Cut‑offs

Other Pages
JEE Advanced Marks vs Ranks 2025: Understanding Category-wise Qualifying Marks and Previous Year Cut-offs

JEE Advanced Weightage 2025 Chapter-Wise for Physics, Maths and Chemistry

NCERT Solutions for Class 11 Maths Chapter 4 Complex Numbers and Quadratic Equations

NCERT Solutions for Class 11 Maths Chapter 6 Permutations and Combinations

NCERT Solutions for Class 11 Maths In Hindi Chapter 1 Sets

JEE Advanced 2025: Dates, Registration, Syllabus, Eligibility Criteria and More
