Spanning Trees Quiz

Which of the following shows a proper spanning tree of the given graph?

• I only

• II only

• Both I and II

• Neither I nor II

Which of the following shows a proper spanning tree of the given graph?

• I only

• II only

• Both I and II

• Neither I nor II

Use Kruskal’s algorithm to determine the minimum spanning tree of the graph.

• 12

• 14

• 16

• 18

A connected graph has 26 vertices. How many edges does a spanning tree of the graph have?

• 26

• 27

• 25

• 28

The graph shows the cost ($ thousands) of installing cable between corporate buildings. Use Kruskal’s algorithm to find the minimum cost spanning tree to establish the cable network.

• 19

• 20

• 21

• 22

Which of the following is a correct vertex coloring of the given graph? (Capital letters indicate which color the vertex is colored.)

• I only

• II only

• Both I and II

• Neither I nor II

Find the chromatic number of the graph below.

• 2

• 3

• 4

• 1

Find the chromatic number of the graph shown below.

• 1

• 4

• 2

• 3