Struktur Diskrit : Latihan Pewarnaan Graf
1. For each given maps :
- Construct the dual graph
- Find the number of colors needed to color the map so that no two adjacent regions have the same color.
2. Find the chromatic number of the given graphs.
3. Schedule the final exams for Math 115, Math 116, Math 185, Math 195, CS 101, CS 102, CS 273, and CS 473, using the fewest number of different time slots, if there are no students taking both Math 115 and CS 473, both Math 116 and CS 473, both Math 195 and CS 101, both Math 195 and CS 102, both Math 115 and Math 116, both Math 115 and Math 185, and both Math 185 and Math 195, but there are students in every other pair of courses.
4. The mathematics department has six committees, each meeting once a month. How many different meeting times must be used to ensure that no member is scheduled to attend two meetings at the same time if the committees are C1 = {Arlinghaus, Brand, Zaslavsky}, C2 = {Brand, Lee, Rosen}, C3 = {Arlinghaus, Rosen, Zaslavsky}, C4 = {Lee, Rosen, Zaslavsky}, C5 = {Arlinghaus, Brand}, and C6 = {Brand, Rosen, Zaslavsky} ?
5. How many different channels are needed for six stations located at the distances shown in the table, if two stations cannot use the same channel when they are within 150 miles of each other ?
6. Find the edge chromatic number of each of the graphs below.
Sumber
Latihan Strukdis : Pewarnaan Graf
Komentar ini telah dihapus oleh administrator blog.
BalasHapusPosting Komentar