How many edges does a spanning tree of a connected graph with 12 vertices contain?
Correct answer C. 11
Explanation
A spanning tree includes every vertex and is a tree, so it has exactly V − 1 edges: 11 for 12 vertices. Fewer edges would leave the graph disconnected, and more would create a cycle. The value 66 is the number of edges in a complete graph on 12 vertices, which is the maximum the original graph could have.
Answer checked How we write and check questions
Discussion