Exercise 13F - Spanning Tree

Choose the option that is NOT correct:

A tree is connected graph that has...

• no loops

• loops

• multiple edges

• cycles

Every connected graph will have at least...

• one subgraph that is a tree

• one loop on each vertex

• one cycle on the graph

• one loop on one vertex

If a tree connects all of the vertices in a graph then it is called a...

• Spanning Branch

• Spanning Root

• Spanning Tree

• Spanning Trunk

If the spanning tree has 10 vertices, it will have how many edges?

• 11

• 10

• 9

• 8

_____ algorithm is used for determining the minimum spanning tree of a network.

A tree with n vertices has..

• n-3 edges

• n-1 edges

• n-2 edges

• n-4 edges

A ________ tree is a tree that connects all the vertices of a graph.

Is this a correct spanning tree?

• Yes

• No

• I don't know

A connected graph has 9 vertices and 13 edges. How many edges will the spanning tree for this connected graph have?

• 5

• 6

• 7

• 8

How many edges need to be removed to complete this spanning tree?

• 4

• 5

• 6

• 7