| (a) |
Show that every tree with at least two vertices has at least one vertex of odd degree.
|
[3] |
| (b) |
The following is an adjacency matrix of a graph. Draw the graph.
|
[3] |
| (c) |
Consider the graph shown below.
(i)Write down the distance matrix.[2 marks ] (ii)Define a walk, a trail and an Eulerian trail of a graph .Find an Eulerian trail in the given graph.[4 marks ]
|
[6] |
| (d) |
Consider the directed graph shown below.
Write down the adjacency matrix for this graph. |
[3] |
