AMT 313 1.0 Computational Discrete Mathematics

Course: AMT 313 1.0 Computational Discrete Mathematics (Compulsory)

Course content:

Graph Representation: Data Structures for Graphs, Modifying, Classifying, and Displaying Graphs, Basic Graph Embeddings, Improving Graph Embeddings, Storing and Editing Graphs, Generating Graphs:Building Graphs from other Graphs, Regular Structures, Trees, Random Graphs, Relation and Functional Graphs, and Properties of Graphs:Graph Traversals, Connectivity, Cycles in Graphs, Graph Coloring, Cliques, Vertex Covers and Independent Sets

Recommended Readings:

1. 1. Gross,J.L. & Yellon,J. (2006). Graph Theory and Its Applications (2^nd ed). CRC Press.
   2. Grossman.J.W. (1990). Discrete Mathematics (An Introduction to Concepts, Methods, and Applications) (1^st ed). Macmillan Publishing Company.