Graph Theory/Combinatorics

Catalog description

The course extends upon concepts introduced in Discrete Mathematics. Graph theory concepts include isomorphism, planarity, Eulerian circuits, and colorings. Network optimization concepts include minimum spanning trees, shortest path, traveling salesperson problem, maximum flow, and matching. Concepts in combinatorics include permutations, combinations, arrangements, distribution, binomial identities, generating functions, and recurrence relations. Students will be required to write proofs for theorems and pseudocode for algorithms.Prerequisite: Math 241.