Trees

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

Assume graph G has no loops or multiple edges. Which of the following graphs are definitely trees?

• G has 9 vertices and 8 bridges 
• G has 11 vertices and 9 edges
• G has 7 vertices and no circuits
• All graphs are trees

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 using Kruskal’s algorithm and provide the overall weight of the MST.

• 250

• 270

• 280

• 260

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

• 15.7

• 15.9

• 15.6

• 15.8

The number of edges in a tree with 32 vertices is 

• 30
  30
• 31
• 32
• 33

A spanning tree is a....

• an organism consisting of leaves, branches and a trunk

• a network with the same number of edges as the original

• set of edges which connects the network and has no circuits

• a graph without any loops