MATH 532 - Systems and Control Theory I

Credits: 3
Fundamental concepts; Eulerian graphs, adjacency and incidence matrices, trees, planar graphs, graph embeddings, connectivity, Hamiltonian graphs, matching, factorization, graphs and groups, Cayley color graphs, line graphs, the Reconstruction problem, spectra of graphs, graph and map coloring, external graph theory, and Ramsey theory.

Prerequisite(s): MATA 262 - Discrete Methods or equivalent.