Exercise · ZW-TREE-006 · ★★☆ Intermediate
One edge is removed from a tree. How many connected components does the resulting graph have?
Choose one option.
Show answer
- A. 2
Explanation
Since there are no cycles, the only path between the endpoints of the edge was the edge itself; once removed, those endpoints lie in different components. It is always 2.
Review the concept: Tree
A tree \(T=(V,E)\) is a connected graph that contains no cycles.
\[|E|=|V|-1\]
More practice problems: tree
- ZW-TREE-001 How many edges does a tree with 10 vertices have?
- ZW-TREE-002 A tree has 15 edges. How many vertices does it have?
- ZW-TREE-003 The vertices are 1,dots,5. Which of these edge sets forms a tree?
- ZW-TREE-004 What is the sum of the vertex degrees of a tree with 7 vertices?
- ZW-TREE-005 A tree with 7 vertices has one vertex of degree 4, one of degree 3, and the rest are leaves (degree…
- ZW-TREE-007 How many different trees are there on labeled vertices 1,2,3,4?
- ZW-TREE-008 An acyclic graph has 10 vertices and 3 connected components. How many edges must be added, without…
- ZW-TREE-009 An edge is added to a tree between two vertices that were not adjacent. The result: