	$A$`A`	$B$`B`	$C$`C`
$A$`A`	$\editable{}$	$\editable{}$	$\editable{}$
$B$`B`	$\editable{}$	$\editable{}$	$\editable{}$
$C$`C`	$\editable{}$	$\editable{}$	$\editable{}$

Easy

< 1min

Fill in the adjacency matrix for this network:

Easy

1min

For this network, fill in the adjacency matrix:

Easy

1min

Fill in the adjacency matrix for this network:

Easy

1min

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

U2.AoS2.8

construct graphs, digraphs and networks and their matrix equivalents to model and analyse practical situations

8.02 Degree and adjacency matrices

Interactive practice questions

Outcomes

U2.AoS2.1

U2.AoS2.8

What is Mathspace

About Mathspace