MonMap
A course mapper by Monash Association of Coding (MAC)
Network mathematics
MTH4170
Synopsis
This unit provides an introduction to graph theory, which is the mathematics of networks. Topics covered include trees, Eulerian tours, Hamiltonian cycles, shortest path problem, bipartite graphs, matchings, graph colouring, max-flow problem, graph connectivity, independent sets, planarity, random graphs. Applications to a variety of the sciences will be presented. You will learn how to write proofs and analyse algorithms.
Sourced from the Monash Handbook 2026.
Quick facts
- Credit points
- 6
- Level
- 4
- Audience
- Undergraduate and Postgraduate
- Type
- Coursework
- School
- Faculty of Science
- Faculty
- School of Mathematics
- Handbook year
- 2026
Prerequisites
No prereqs in the handbook graph.
What it unlocks
Nothing in the visible graph depends on this unit.
Offerings (1)
- Second semesterClayton · ON-CAMPUS