A minimum spanning tree of a given graph is the subgraph, which is a tree, includes every

Question:

A minimum spanning tree of a given graph is the subgraph, which is a tree, includes every vertex of the original graph, and which has the least weight of all spanning trees.

a. True

b. False

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: