topic badge

7.01 Trees and spanning trees

Interactive practice questions

Consider the following graphs.

a

Which of these graphs is a tree?

A

B

C
b

Why is the following graph not a tree?

It is disconnected.

A

It has a loop.

B

It has multiple edges connecting the same vertices.

C

it has a cycle.

D
c

Why is the following graph not a tree?

It has a loop.

A

It is disconnected.

B

It has a cycle.

C

It has multiple edges connecting the same vertices.

D
Easy
< 1min

Consider the following graphs.

Easy
< 1min

Given the following networks:

Easy
< 1min

In graph theory terms, what is a tree?

Medium
< 1min
Sign up to access Practice Questions
Get full access to our content with a Mathspace account

Outcomes

4.3.1

identify practical examples that can be represented by trees and spanning trees

4.3.2

identify a minimum spanning tree in a weighted connected graph, either by inspection or by using Prim’s algorithm

What is Mathspace

About Mathspace