MST: Prim & Kruskal

A graph can only have one(1) spanning tree.

• TRUE
• FALSE

In solving the weight of a minimum spanning tree you should subtract the weight of all edges.

• TRUE
• FALSE

What is the weight of the Minimum Spanning tree?

• 2
• 6
• 3
• 8

What is the weight of the Minimum Spanning tree?

• 17
• 16
• 15
• 14

What is the weight of the Minimum Spanning tree?

• 13
• 17
• 19
• 21

What is the weight of the Minimum Spanning tree?

• 1
• 44
• 17
• 22

What is the weight of the Minimum Spanning tree?

• 12
• 17
• 14
• 15

Which of the four graphs pictured below are trees?

• Graph 2
• Graph 2, 4
• Graph 2, 3
• Graph 2,3,4

Which of the four graphs pictured below are not trees?

• Graph 3
• Graph 2, 4
• Graph 2, 3
• Graph 1,3

The number of vertices in a tree with 12 edges is 

• 10
• 11
• 12
• 13