Skip to main content
Unit of study_

MATH2069: Discrete Mathematics and Graph Theory

This unit introduces students to several related areas of discrete mathematics, which serve their interests for further study in pure and applied mathematics, computer science and engineering. Topics to be covered in the first part of the unit include recursion and induction, generating functions and recurrences, combinatorics. Topics covered in the second part of the unit include Eulerian and Hamiltonian graphs, the theory of trees (used in the study of data structures), planar graphs, the study of chromatic polynomials (important in scheduling problems).

Code MATH2069
Academic unit Mathematics and Statistics Academic Operations
Credit points 6
6 credit points of MATH1XXX except (MATH1XX5 or MATH1111)
MATH2011 or MATH2009 or MATH2969

At the completion of this unit, you should be able to:

  • LO1. identify and use combinatorial objects involved in counting problems to solve them
  • LO2. solve linear recurrence relations by using generating functions and characteristic equations
  • LO3. identify Eulerian and Hamiltonian graphs
  • LO4. apply special algorithms to find minimal walks in weighted graphs
  • LO5. apply special algorithms to find spanning trees in graphs
  • LO6. find chromatic numbers and chromatic polynomials of graphs.