| (a) | Draw K6.
|
[2] |
|
||
| (b) | Let R be a binary relations on A = {
2,3,4,5,6,7,8} defined by :
(i) Draw the directed graph for R. (ii) Write down the adjacency matrix for R. (iii) Write down the distance matrix for R.
|
[4] [4] [4] |
| (i)
|
||
| (ii)
|
||
| (iii)
|
||
| (c) | Determine whether or not the graphs below are Eulerian. If they are, write down a Euler circuit otherwise explain why it is not Eulerian. | |
| (i)
|
[3] | |
| (ii)
|
[3] | |
| (i) The graph is Eulerian. A Euler circuit is ABFGIHCAHDBEFIED.
|
||
| (ii) The graph is not Eulerian. It is not Eulerian because some of the vertices (e.g. v0) are odd.
|
