Answer
(a)
According to the rules of traversability of the graph theory, a graph is traversable if there are two odd vertices. In the given figure there are two odd vertices (B and C, because the number of edges attached to these vertices is odd) and four even vertices (A, D, E,and F, because the number of edges attached to these vertices is even). Therefore, the given graph is traversable.
The given figure is traversable.
(b)
In order to find a path that traverses this graph, we use Euler’s second rule. It states that we must start at either of the odd vertices and finish at the other vertex of the graph. In the sample path, we will start with the vertex B (odd vertex) and end the path at vertex C (odd vertex).
Hence, the sample path is B, A, C, F, E, B, F, C, D, E, B, C
