How many edges does a tree with 9 vertices have?
Answer and explanation
Correct answer: B. 8
- Step 1: A tree is connected and has no cycles. Step 2. A tree on n vertices has n − 1 edges: 8. Answer: 8. Why not the others: 9 is what you get if you give the number of vertices. 10 is what you get if you add one edge. 36 is what you get if you give the edges of the complete graph.
Practise more Linear algebra, calculus and probability.
Free questions with an explanation for every one, and full timed GATE mock tests.
More Linear algebra, calculus and probability questions
- What is the rank of the matrix with rows (3, 6, 9); (6, 12, 18); (9, 18, 27)?
- If P(A and B) = 0.05 and P(B) = 0.5, what is P(A given B)?
- Find the divergence of F = (x², y², z²) at the point (1, 2, 2).
- The solution of dy/dx = −6y with y(0) = 6 is
- How many labelled spanning trees does the complete graph K7 have?
- How many functions are there from a set of 5 elements to a set of 6 elements?