If graph G is a connected graph, the spanning tree of G is a max

If graph G is a connected graph, the spanning tree of G is a maximal connected subgraph containing all n vertices of G. ~@[](2)

答案：FALSE