Discrete Mathematics

3 credits · Graduate School

(Also listed as MATH 3700) Elementary combinatorics including permutations and combinations, the principle of inclusion and exclusion, and recurrence relations. Graph theory including Eulerian and Hamiltonian graphs, trees, planarity, coloring, connectivity, network flows, some algorithms and their complexity. Selected topics from computer science and operations research. No credit for students who have earned credit for 3700. [3]