Tree Vocabulary NWD

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

The number of edges in a tree with 32 vertices is 

• 30
  30
• 31
• 32
• 33

How many spanning trees does the graph have?

• 3
• 4
• 5
• 8

Sorting the edges:

• BC, EB, BD, AD, AE, CD, AB
• BC, BD, AD, CD, AB, AE, EB
• BC, BD, EB, CD, AB, AD, AE
• NO ANSWER

Sorting the edges:

• NO ANSWER
• bc, ef, ab, cf, bf, af, df, cd, ae,de
• bc, ab, ef, cf, bf, df, af, ae, cd, de
• bc, ef, ab, bf, cf, af, df, ae, cd, de

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

What is the shortest path from Bristol to London?

• 125

• 120

• 115

• 130