Question

a) Ten members of IT Club are driving to a conference in a neighboring college. However, some of these students have dated in the past, and things are still a little awkward. Each student lists which other students they refuse to share a car with; these conflicts are recorded in the table below. Use concept of graph theory to determine the fewest number of cars the club needs to make the trip. Do not worry about running out of seats, just avoid the conflicts. [5

Answer 1

Ten members of IT Club are driving to a conference in a neighboring college. However, some of these students have dated in the past, and things are still a little awkward. Each student lists which other students they refuse to share a car with; these conflicts are recorded in the table below. Use concept of graph theory to determine the fewest number of cars the club needs to make the trip. Do not worry about running out of a) Ten members of IT Club are driving to a conference in a neighboring college. However, some of these students have dated in the past, and things are still a little awkward. Each student lists which other students they refuse to share a car with; these conflicts are recorded in the table below. Use concept of graph theory to determine the fewest number of cars the club needs to make ta) Ten members of IT Club are driving to a conference in a neighboring college. However, some of these students have dated in the past, and things are still a little awkward. Each student lists which other students they refuse to share a car with; these conflicts are recorded in the table below. Use concept of graph theory to determine the fewest number of cars the club needs to make the trip. Do not worry about running out of seats, just avoid the conflicts. [5