1. JP Hammond is an alien pet hobbyist and has a number of pet aliens at...

Transcribed Image Text:

1. JP Hammond is an alien pet hobbyist and has a number of pet aliens at his personal zoo. For redecoration of his zoo, he needs to transport the aliens to a nearby zoo. During this transfer, he wants to minimize the number of cages needed. But some of the aliens cannot be kept together as they have predator-prey relationship as shown below: Alphas - Betos Certas - Delatos Certas - Espas Fetas - Espas Delatos - Fetas Espas-Betos Alphas - Certas Betos - Certas a) What is the minimum number of cages needed for the transfer? [Hint: use graph coloring] b) Find a possible transfer arrangement of the aliens. c) What are the chromatic numbers for the following graphs: i. vi. ii. vii. viii. ix. X. 111. iv. Wn Kn K5,3 A tree with 28 vertices A path of length 19 r-Regular graph Q3 Complete multipartite graphs, Kr1.r2.... A maximal planar graph with 5 vertices A closed walk of length n 10 5 10 1. JP Hammond is an alien pet hobbyist and has a number of pet aliens at his personal zoo. For redecoration of his zoo, he needs to transport the aliens to a nearby zoo. During this transfer, he wants to minimize the number of cages needed. But some of the aliens cannot be kept together as they have predator-prey relationship as shown below: Alphas - Betos Certas - Delatos Certas - Espas Fetas - Espas Delatos - Fetas Espas-Betos Alphas - Certas Betos - Certas a) What is the minimum number of cages needed for the transfer? [Hint: use graph coloring] b) Find a possible transfer arrangement of the aliens. c) What are the chromatic numbers for the following graphs: i. vi. ii. vii. viii. ix. X. 111. iv. Wn Kn K5,3 A tree with 28 vertices A path of length 19 r-Regular graph Q3 Complete multipartite graphs, Kr1.r2.... A maximal planar graph with 5 vertices A closed walk of length n 10 5 10 1. JP Hammond is an alien pet hobbyist and has a number of pet aliens at his personal zoo. For redecoration of his zoo, he needs to transport the aliens to a nearby zoo. During this transfer, he wants to minimize the number of cages needed. But some of the aliens cannot be kept together as they have predator-prey relationship as shown below: Alphas - Betos Certas - Delatos Certas - Espas Fetas - Espas Delatos - Fetas Espas-Betos Alphas - Certas Betos - Certas a) What is the minimum number of cages needed for the transfer? [Hint: use graph coloring] b) Find a possible transfer arrangement of the aliens. c) What are the chromatic numbers for the following graphs: i. vi. ii. vii. viii. ix. X. 111. iv. Wn Kn K5,3 A tree with 28 vertices A path of length 19 r-Regular graph Q3 Complete multipartite graphs, Kr1.r2.... A maximal planar graph with 5 vertices A closed walk of length n 10 5 10 1. JP Hammond is an alien pet hobbyist and has a number of pet aliens at his personal zoo. For redecoration of his zoo, he needs to transport the aliens to a nearby zoo. During this transfer, he wants to minimize the number of cages needed. But some of the aliens cannot be kept together as they have predator-prey relationship as shown below: Alphas - Betos Certas - Delatos Certas - Espas Fetas - Espas Delatos - Fetas Espas-Betos Alphas - Certas Betos - Certas a) What is the minimum number of cages needed for the transfer? [Hint: use graph coloring] b) Find a possible transfer arrangement of the aliens. c) What are the chromatic numbers for the following graphs: i. vi. ii. vii. viii. ix. X. 111. iv. Wn Kn K5,3 A tree with 28 vertices A path of length 19 r-Regular graph Q3 Complete multipartite graphs, Kr1.r2.... A maximal planar graph with 5 vertices A closed walk of length n 10 5 10

Answer rating: 100% (QA)

Consider representing Alphas Betos 0 that and be kept other is prey the graph is 0 O a 0 2 verticu w... View the full answer