Exercise 2C c

1 a Graph 1 and 3 are connected. Graphs 2

and 4 are not connected.
b Graph 2 and 3 are connected. Graphs 1 and
4 are not connected.

2 There are many possible answers to this

d
question. An example is shown below.
a

4a Graph 1 (Vertex C has degree 3 in graphs

b
2,3 and 4 but degree 2 in graph 1). Graphs 2,
3, and 4 have the same edges.
b Graph 2 (Vertex C has degree 2 in graphs
1,3 and 4 but degree 3 in graph 2). Graphs 1,
3, and 4 have the same edges.

c 5a Vertices are the train stations

b Edges are the rail lines that connect the train
stations.
c Yes. Every vertex in the graph is accessible
from every other vertex.
d City circle – Central, Town hall, Wynyard,
d Circular Quay, St James, Museum and Martin
Place.
e

3 There are many possible answers to this

question. An example is shown below.
a

6a Vertices are the regional towns and cities,

and other places where roads meet.
b b Edges are the main roads.
c Yes. Every vertex in the graph is accessible
from every other vertex.
 d B and C are not linked to A
d e Travel from F to A and then from A to D
f 35 + 27 = 62 km

10 Different answers are possible. A possible

solution is given below.

7a

b The edges represent whether there is a

friendship between the two students.
c Yes. Every vertex in the graph is accessible
from every other vertex. 11
d Bonnie to Lara to Toby to Rose

8a
Alex

1
2

3
Harvey Zac

4 2 12
Max
b Vertices are the names of the players
c Edges indicate time in minutes to walk
between friends’ homes.
d Alex and Max have not played a match
against each other.

9a

A B 13
48
35
27 24 C
51
F
12

E D

b Vertices are the cities A to F

c Edges are the motorways M1 to M6