1. Chapter 4 Review Math Analysis
“Stick It To ‘Em”

2. Complete the task table for the graph below:

3. Task Table:
TASK
TIME
PREREQUISITES
Start
None A B C D E F G H
Finish

4. Task Table: TASK TIME PREREQUISITES Start None A 5 B 4 C 6 D 7 E 8
None A 5 B 4 C 6 D 7 E 8
B, C F
D, E G 1 H 3
F, G
Finish

5. Represent the following graph with an adjacency matrix

7. List the following as a set of vertices and edges

9. Fill in the blanks:
A) The degree of each vertex of a K4 graph is ______
B) The degree of each vertex of a Kn graph is ______

11. Use the graph below to answer the questions
A) Write as a set of vertices and ordered edges
B) Does the graph have an Euler circuit? Explain.

13. Find a Hamiltonian Circuit for the following graph:

15. Using the CONDORCET method construct a cumulative preference schedule that would show the overall results of the four individual preference schedules

17. Construct an Adjacency Matrix for the following graph:

19. What is the chromatic number for the following graphs?
A) B)