Discrete Chapter 7 Trees

A tree is

• any graph that has no circuits

• any graph that has no bridges

• any graph that is connected and has no circuits

• any graph with one component

How may spanning trees does the following graph have?

• 15

• 24

• 25

• 23

How many different spanning trees does the following graph have?

• 23

• 15

• 24

• 25

Using Kruskal's algorithm which edge is chosen third?

• Boston-Chicago

• Boston-Buffalo

• Buffalo-Columbus

• Columbus-Louisville

Which of the following edges is not in the minimum spanning tree?

• Boston-Chicago

• Boston-Buffalo

• Buffalo-Columbus

• Columbus-Louisville

The length of the minimum spanning tree is

• 2236

• 1135

• 1273

• 1795