Undirected graphs and networks
Undirected graphs and networks
Undirected graphs and networks
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
176 General Mathematics<br />
WORKED<br />
Example<br />
6<br />
WORKED<br />
Example<br />
7<br />
21D<br />
Hamiltonian paths<br />
<strong>and</strong> circuits<br />
1 Determine which of the following have a:<br />
a Hamiltonian path b Hamiltonian circuit.<br />
i ii iii<br />
iv v vi<br />
2 The graph at right represents a delivery route with O being the<br />
central office. A courier must deliver items to each of the eight<br />
places labelled 1, 2, . . ., 8. The edges represent roads between<br />
1<br />
4<br />
2<br />
O<br />
3<br />
5<br />
the places. Plan a delivery route for the courier to deliver the<br />
items to each of the eight places without going to the same place<br />
6<br />
7 8<br />
twice. The courier must return to the central office after the items have been delivered.
Change language