This course provides an introduction to discrete mathematics, particularly graph theory. Emphasis will be placed on the algorithmic aspects of the area.

MATH.3220 — Online and Continuing Education Id: 008322 Offering: 2 Credits: 3-3 Description Examines graph theory, trees, algebraic systems, Boolean algebra, groups, monoids, automata, machines, rings ...

Graph theory, a nearly 300-year-old discipline considered an element of discrete mathematics, is used to model many types of relationships and processes in physical, biological, social and information ...

MATH.2190 — Undergraduate Id: 008321 Offering: 1 Credits: 3-3 Description Presents propositional logic, combinatorics, methods of proof, mathematical systems, algebra of sets, matrix algebra, ...

The graph isomorphism problem asks for an algorithm that can spot whether two graphs — networks of nodes and edges — are the same graph in disguise. For decades, this problem has occupied a special ...

Introduces students to ideas and techniques from discrete mathematics that are widely used in science and engineering. Mathematical definitions and proofs are emphasized. Topics include formal logic ...