## MTH210 |
## Tutorial 5 | |

[an error occurred while processing this directive]
## (none) |
[an error occurred while processing this directive]
## Introduction to Graph Theory[an error occurred while processing this directive]## (none) |
[an error occurred while processing this directive]
## Due: (none) |

- p. 663 #17, 20, 26
- p. 664 #40, 42
- p 680 #4, 6c, 7, 8c
- p. 681 #15, 20
- p. 681 #24, 31
- Note that this question is an expansion of p. 683 #47 and 48.

For what values of n (and m where appropriate) do the following graphs have:- An Eulerian Circuit
- A Hamiltonian Circuit.

- The complete graph K
_{n}. - The complete bipartite graph K
_{m,n}. - The circuit C
_{n}. - The simple path P
_{n}. - A diconnected graph with n edges.

Last modified Friday, 05-Feb-2010 15:32:12 EST