Networks
New Zealand
Level 7 - NCEA Level 2
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
Easy
< 1min
Which of the following statements about trees are true? Select all that apply.
Easy
< 1min
The following questions relate to spanning trees.
Easy
< 1min
Consider the following graphs.
Easy
< 1min
Sign up to access Practice Questions
Get full access to our content with a Mathspace account