Question:medium
In a tree on a vertices there is exactly one vertex with degree 2 and remaining vertices are of degree either 1 or 3. Then the number of pendant vertices is
In a tree on a vertices there is exactly one vertex with degree 2 and remaining vertices are of degree either 1 or 3. Then the number of pendant vertices is
Show Hint
Sum of degrees = $2(E)$ and $E = n-1$ for tree.
Updated On: Apr 8, 2026
- $8$
- $5$
- $4$
- $6$
Show Solution
The Correct Option is C
Solution and Explanation
Was this answer helpful?
0
Top Questions on Graph Theory
- How many edges are there in a complete graph with \(n\) vertices?
- CUET (PG) - 2026
- Data Science
- Graph Theory
Match LIST-I with LIST-II
Choose the correct answer from the options given below:
- CUET (PG) - 2025
- Data Science
- Graph Theory
- Consider the given graph and shortest paths: The shortest paths given are: \[ a - b - c - d, \quad e - f - g - h, \quad a - f - c - h \] Which of the following cannot be an edge in the original graph?
Let \( G \) be a simple, unweighted, and undirected graph. A subset of the vertices and edges of \( G \) are shown below.
It is given that \( a - b - c - d \) is a shortest path between \( a \) and \( d \); \( e - f - g - h \) is a shortest path between \( e \) and \( h \); \( a - f - c - h \) is a shortest path between \( a \) and \( h \). Which of the following is/are NOT the edges of \( G \)?- Want to practice more? Try solving extra ecology questions todayView All Questions
