Unformatted text preview: vertices A and B of odd degree. One possibility is ACBDADCAB. 9. The graph depicting the situation is shown at the right. (a) This question asks whether the graph is Eulerian. It is not: there are vertices of odd degree, A, for instance. B~ C (b) This question asks whether the graph has an Eulerian trail. It does, between A and F, since these are the unique vertices of odd degree in a connected graph. One possible trail is ABDBCDCECFEDFADF. 10. [BB] Yes. In this case, both 9 and 1{ must be cycles. 11. The resulting graph has an Eulerian trail (between VI and V2) but no Eulerian circuit. This is because, in the new graph, VI and V2 are the only vertices of odd degree....
View
Full Document
 Summer '10
 any
 Graph Theory, Leonhard Euler, Eulerian path, Seven Bridges of Königsberg, Eulerian, Eulerian Circuit

Click to edit the document details