Singapore University of Social Sciences

Fundamentals of Graph Theory

Fundamentals of Graph Theory (MTH366)


MTH366 Fundamentals of Graph Theory will introduce fundamental principles, techniques and algorithms in Graph Theory. The emphasis of the course will be on applications of the results presented to solve problems. Additionally, the course will teach students how algorithms taught in the course are implemented using Python.

Level: 3
Credit Units: 5
Presentation Pattern: Every January


  • Edges and Cycles
  • Bipartite Graphs
  • Trees
  • Connectivity
  • Eulerian Multigraphs
  • Hamiltonian Graphs
  • Matching
  • Covering
  • Independence
  • Planar Graphs
  • Vertex Coloring
  • Digraphs

Learning Outcome

  • Show how to prove a mathematical statement in graph theory.
  • Determine whether given graphs are Hamiltonian/semi-Hamiltonian, Eulerian/semi-Eulerian and/or planar.
  • Calculate the chromatic number, dominance number or independence number of a given graph.
  • Apply algorithms and theorems covered in the course to graph theory problems.
  • Compute edge connectivity/vertex connectivity, weights of spanning trees and/or number of spanning trees of a given graph.
  • Construct examples/counter-examples of graphs to given mathematical statements on graph theory.
Back to top
Back to top