MTH210
Tutorial 5
Introduction to Graph Theory
Readings
This tutorial covers material from section 11.1 and 11.2 of the textbook. Page and exercise numbers are from the course textbook.
Tutorial 5
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.
Explain your answers.
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.
This page is maintained by
Peter Danziger.
Last modified Friday, 05-Feb-2010 15:32:12 EST