Spanning Trees

The graph shown contains NO cycles.

• True

• False

The graph shown contains NO cycles.

• True

• False

Which of the following statements are TRUE about a minimal spanning tree?

• Each branch has a weight.

• Contains no cycles.

• All vertices are connected.

• The path results in the minimum total weight.

Create a minimal spanning tree, then find the minimum total cost.

• 30

• 39

• 47

• 50

Create a minimal spanning tree, then find the minimum total cost.

• 20

• 21

• 22

• 23

The number of vertices in a tree with 12 edges is 

• 10
• 11
• 12
• 13

Using Kruskal’s algorithm, which edge should you choose second?

• AE

• BD

• DE

• AB

Using Kruskal’s algorithm, which edge should you choose fourth?

• AB

• BC

• BD

• DE

Find the minimum spanning tree (MST) using Kruskal’s algorithm and provide the overall weight.

• 20

• 25

• 28

• 30

Find the minimum spanning tree (MST) using Kruskal’s algorithm and provide the overall weight.

• 20

• 25

• 28

• 30