This preview shows page 1. Sign up to view the full content.
Unformatted text preview: for n 2. Question 4. [5 marks] Exercise 6, page 188 of the text book. Question 5. [5 marks] Exercise 2, page 188 of the text. (A graph is called bi-partite if you can colour its vertices in two dierent colours such that no two adjacent vertices have the same colour.) 1...
View Full Document
This note was uploaded on 09/28/2011 for the course ECE 103 taught by Professor Nayak during the Spring '11 term at Waterloo.
- Spring '11