For the graph given in Fig. I 9.3 (a) obtain (i) The cut sets (ii) An Eulerian walk (iii) A…

For the graph given in Fig. I 9.3

(a) obtain

(i) The cut sets

(ii) An Eulerian walk

(iii) A Hamiltonian path

(b) Is the graph complete?

Which of the following does not hold good for the given
graph G?

(i) an Eulerian walk exists for the graph

(ii) the graph is an undirected graph

(iii) the graph has a cycle

(iv) the graph has a pendant vertex

(a) (i) (b) (ii) (c) (iii) (d) (iv)