NZ Level 7 (NZC) Level 2 (NCEA)
topic badge
Trees and spanning trees

Interactive practice questions

In graph theory terms, what is a tree?

A graph in which at least one vertex is connected by an edge to every other vertex.

A

A graph in which every vertex is connected by an edge to every other vertex.

B

A connected graph in which every edge is a bridge.

C

A connected graph in which no vertex has a degree higher than $2$2.

D

A graph in which at least one vertex is connected by an edge to every other vertex.

A

A graph in which every vertex is connected by an edge to every other vertex.

B

A connected graph in which every edge is a bridge.

C

A connected graph in which no vertex has a degree higher than $2$2.

D
Easy
Less than a minute
Sign up to try all questions

Which of the following statements about trees are true? Select all that apply.

The following questions relate to spanning trees.

Consider the following graphs.

Outcomes

M7-5

Choose appropriate networks to find optimal solutions

91260

Apply network methods in solving problems

What is Mathspace

About Mathspace