MAT 318 - Discrete Methods

3 Semester Hours
Prerequisite: MAT 122
Graph theory (graphs as models, basic properties of graphs and digraphs, trees, graph coloring, Eulerian and Hamiltonian circuits), combinatorics (elementary counting principles, permutations and combinations, inclusion/exclusion principle, recurrence relations).