{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# hw9 - for n ≥ 2 Question 4[5 marks Exercise 6 page 188 of...

This preview shows page 1. Sign up to view the full content.

ECE 103 Discrete Math for Engineers University of Waterloo Spring 2010 Instructors: Koray Karabina, Ashwin Nayak Homework 9, due July 26, 2010 Question 1. [5 marks] Exercise 2, page 185 of the text book. Question 2. [5 marks] Exercise 7(a), 7(c), page 185 of the text book. Question 3. [5 marks] Prove that none of the edges in the n -hypercube is a cut-edge (also called a bridge),
This is the end of the preview. Sign up to access the rest of the document.

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 diﬀerent colours such that no two adjacent vertices have the same colour.) 1...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online