topic badge
AustraliaVIC
VCE 11 General 2023

8.04 Walks and paths

Interactive practice questions

A path is:

A sequence of edges joined by vertices where no vertex is repeated (excluding the possibility of the start and end vertex).

A

An edge that connects a vertex to itself.

B

A sequence of edges that start and end at the same vertex.

C

A sequence of edges joined by vertices where no edge is repeated.

D
Easy
< 1min

Which of the following are valid paths?

Easy
< 1min

Which of the following are valid paths?

Easy
< 1min

Which two of the following are valid paths?

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

Outcomes

U2.AoS2.1

the language, properties and types of graphs, including edge, face, loop, vertex, the degree of a vertex, isomorphic and connected graphs, and the adjacency matrix, Euler’s formula for planar graphs, and walks, trails, paths, circuits, bridges and cycles in the context of traversing a graph

What is Mathspace

About Mathspace