MME 531: Discrete Mathematics

This course deals with concepts and methods which emphasize the discrete nature in many problems and structures. The rapid growth of this branch of mathematics has been inspired by its wide range of applicability to diverse fields such as computer science, management, and biology. The essential ingredients of the course are: Combinatorics -The Art of Counting. Topics include basic counting principles and methods such as recurrence relations, generating functions, the inclusion-exclusion principle and the pigeonhole principle. Applications may include block designs, latin squares, finite projective planes, coding theory, optimization and algorithmic analysis. Graph Theory. This includes direct graphs and networks. Among the parameters to be examined are traversibility, connectivity, planarity, duality and colorability.