We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2
Course outline
Discrete Mathematics and Combinatorics (Math2231)
Course Titles/Code: Discrete Mathematics and Combinatorics (Math2231)
1. Elementary counting principles
1.1. Basic counting principles 1.2. Permutations and combinations 1.3. The Inclusion-exclusion principle 1.4. The Pigeonhole principle 1.5. The Binomial theorem 2. Recurrence relations
2.1 Definition and examples
2.2 Linear recurrence relations with constant coefficient
2.3 Solving linear recurrence relations
2.4 Solving homogeneous and nonhomogeneous recurrence relations
3. Elements of graph theory
3.1 Definition and examples of a graph
3.2 Matrix representation of a graph
3.3 Isomorphic graphs
3.4 Path and connectivity of a graph
3.5 Complete, regular and bipartite graphs
3.6 Eulerian and Hamiltonian graphs
3.7 Trees and forests (Rooted and Binary trees)
3.8 Planar graphs
3.9 Graph coloring
4. Directed graphs
4.1 Definition and examples of digraphs
4.2 Matrix representation of digraphs
4.3 Paths and connectivity
5. Weighted graphs and their applications
5.1 Weighted Graphs
5.2 Minimal Spanning trees
5.3 Shortest path problem
5.4 Critical Path Problem
Assessment methods
• Assignments( at least two) ………. 20%
• Quizzes ( at least three) …………. 40%
• Final Examination (3 hrs) ……….. 40%
Recommended References of the course
1. B. Harris, Graph Theory and its applications, Academic press, 1970 2. Iyengar, S. N, Elements of Discrete Mathematics 3. Lipschutz, S., Schaum’s outline series, Discrete Mathematics 4. Steven Roman, An Introduction to Discrete Mathematics 5. Mattson, H.F., Discrete Mathematics with Application 6. J. A. Bondy and U. S. R. Murthy, Graph Theory with Applications, Elsevier Science Publishing Co. Inc. New York, 1976.