Consider a complete graph G with 4 vertices. The graph G has spanning trees.
|Answer» C. 16|
|Explanation: a graph can have many spanning trees. and a complete graph with n vertices has n(n-2) spanning trees. so, the complete graph with 4 vertices has 4(4-2) = 16 spanning trees.|
Login to Continue
It will take less than 2 minutes