Worksheets12 General Unit 4 Topic 2 2020
Total questions: 10
Worksheet time: 6mins
For the graph shown below, which vertex has degree 5?
Q
T
S
R
U
Which one of the following is not a subgraph of the graph shown on the right?
The graph that has been drawn from the adjacency
matrix shown on the right is:
The adjacency matrix that corresponds to the graph
on the right is:
A connected graph with 15 vertices divides the plan e into 12 faces. How many edges does this graph have?
15
23
24
25
27
A connected planar graph divides a plane into a number of faces. If the graph has eight vertices and these are linked by 13 edges, then how many faces does it have?
5
6
7
8
10
The walk A – E – D – C – B – A is best described as a:
cycle
Hamiltonian path
Eulerian trail
closed trail
open walk
The walk E – A – F – C – D – E is best described as a:
Eulerian trail
closed path
Hamiltonian cycle
closed trail
open walk
For the graph shown on the right, which edge could
be removed to result in a semi-Eulerian graph?
A – B
A – D
B – E
C – F
D – F
The length of the shortest path from F to B in the network shown on the right is:
17
18
19
20
21
