MonMap
A course mapper by Monash Association of Coding (MAC)
Network mathematics
MTH3170
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
- 3
- Audience
- Undergraduate
- Type
- Coursework
- School
- Faculty of Science
- Faculty
- School of Mathematics
- Handbook year
- 2026
Prerequisites (10)
- Theory of computationFIT2014
- Techniques for modelling (Advanced)MTH1035
- Linear algebra (Advanced)MTH2025
- Number theory and cryptographyMTH2137
- Algebra 1: Group theoryMTH2141
- Differential geometryMTH3110
- Topology: The mathematics of shapeMTH3130
- Number theory and cryptography (Advanced)MTH3137
- Real analysisMTH3140
- Algebra 1: Group theoryMTH3141
What it unlocks (2)
- Advanced graph theoryMTH4151
- Advanced graph theoryMTH5151
Offerings (1)
- Second semesterClayton · ON-CAMPUS
Listed in 9 areas of study
- Algorithms and softwareLevel 3 elective unit
- Applied mathematicsAdditional elective unit
- Computational scienceComputer science electives
- Computational scienceComputer science electives
- MathematicsMathematics elective units
- MathematicsMathematics elective units
- Pure mathematicsPure mathematics elective units
- Pure mathematicsPure mathematics elective units
- Mathematical statisticsAdditional elective units