COMP2101/CS20S Discrete Mathematics Graph Theory and Matching 1. 2. Prove that K5 is not planar.

. Find a Hamilton cycle in the graph shown below

3.

Consider the graph below

i. ii.

Prove that a Hamiltonian cycle does not exist in this graph If a Hamiltonian path exists, describe one; otherwise, prove that a Hamiltonian path does not exist.

4.

Prove that a simple, connected graph with n > 1 vertices and n-1 edges must contain a vertex of degree 1. Draw K2,5, the complete bi-partite graph on 2 and 5 vertices. Consider the graph below

5. 6.

i.

If an Euler cycle exists, describe it; otherwise state why one does not exist in this graph If an Euler path exists, describe one; otherwise, prove that an Euler path does not exist.

ii.

7.

A small school has five teachers, Andy, Beth, Charl, Donnue and Eve. In the spring term, six courses, CS1, CS2, CS3, CS4, CS5 and CS6, are to be offered. Each teacher is qualified to teach one or more courses. The school has the following information for each teacher. Teacher Andy Beth Charl Donnue Eve i. ii. iii. Courses qualified for CS1, CS5, CS6 CS2, CS4 CS1, CS2, CS3 CS3, CS4 CS2, CS6

Model the above situation as a matching network Find a maximal matching Find a way in which each teacher can be assigned to teach a course or use Halls Theorem to explain why no such way exists.

8.

Applicant A is qualified for jobs J1, J2, J4 and J5; B is qualified for jobs J1, J4 and J5; C is qualified for jobs J1, J4 and J5; D is qualified for jobs J1 and J5. E is qualified for jobs J2, J3 and J5; F is qualified for jobs J4 and J5. Model the above situation as a matching network Find a maximal matching Show a complete matching or Use Halls Theorem to show that one does not exist.

9.

Applicant A is qualified for jobs J2, J4 and J5; applicant B is qualified for jobs J1 and J3; applicant C is qualified for jobs J1, J3 and J5; and applicant D is qualified for jobs J3 and J5 . Model the above situation as a matching network Find a maximal matching Show a complete matching or Use Halls Theorem to show that one does not exist.