MTH3170 Network mathematics
Faculty of Science
MTH3170 Network mathematics is a level 3, 6-credit-point, undergraduate unit from the Faculty of Science, offered in 2025 in Semester 2 at Clayton. It has no prerequisites and unlocks 2 units.
- Credit points
- 6
- Offered in 2025
- Semester 2
- Clayton
- Assessment
- Exam 50%
- and 1 other task
This is the 2025 handbook entry. See the 2027 entry.
Reviews
No reviews yetNo reviews yet. Be the first to review MTH3170.
Requisites
Before MTH3170
Prohibitions
You can't enrol if you have passed any of these.
After MTH3170
2 units list MTH3170 as a prerequisite or corequisite.
Enrolment rules
PROHIBITION: MTH3175
Equivalent units
The same content under another code. Only one of them counts.
Overview
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.
Offerings in 2025
| Teaching period | Campus | Mode |
|---|---|---|
| Second semester | Clayton | On campus |
Assessment
- Continuous assessmentDemonstration50%
- Final assessment: Exam (3 hours and 10 minutes)Examination50%
Learning outcomes
When you finish this unit, you should be able to:
- 1
Apply the basic concepts of graph theory.
- 2
Demonstrate the importance and breadth of applications of graph theory in mathematics and the sciences, especially computer science.
- 3
Apply some of the most famous theorems of graph theory such as the max-flow-min-cut theorem, the marriage theorem, and the 4-colour theorem.
- 4
Construct basic mathematical proofs of theorems about graphs.
- 5
Execute and analyse algorithms for solving various graph optimisation problems.
- 6
Demonstrate advanced problem solving skills, both individually and collectively with staff and fellow students.
- 7
Demonstrate advanced skills in the written and oral presentation of mathematical arguments.
Workload and teaching
- Seminars36 hours
- Applied sessions22 hours
- Teaching approachActive learning
- Three 1-hour seminars;
- One 2-hour applied class (in weeks 2-12) and
- 7 hours of independent study per week.
Where it fits
MTH3170 is part of 9 areas of study in the 2025 handbook.
- ALGSFTWR01Level 3 elective unitAlgorithms and softwareNo reviews yet
- APPLMTH07Additional extended major elective unitApplied mathematicsNo reviews yet
- COMPUSC07Advanced computational science electivesComputational scienceNo reviews yet
- COMPUSC08Computer science electivesComputational scienceNo reviews yet
- MTHSTAT07Mathematical statistics elective unitsMathematical statisticsNo reviews yet
- MATHS09Mathematics elective unitsMathematicsNo reviews yet
- MATHS11Mathematics elective unitsMathematicsNo reviews yet
- MATPURE09Pure mathematics elective unitsPure mathematicsNo reviews yet
- MATPURE11Pure mathematics elective unitsPure mathematicsNo reviews yet
Contacts
- Unit Coordinators
- Professor David Wood
- Chief Examiners
- Professor David Wood
Common questions
What are the prerequisites for MTH3170?
MTH3170 has no prerequisites, but enrolment rules apply.
What can I take after MTH3170?
MTH3170 is a prerequisite or corequisite for 2 units, including MTH4151 and MTH5151.
When is MTH3170 offered?
In 2025, MTH3170 runs in Semester 2 at Clayton.
Does MTH3170 have an exam?
Yes. The exam is worth 50% of the final mark, alongside 1 other task.
Which majors and minors include MTH3170?
MTH3170 is part of Algorithms and software; Applied mathematics; Computational science; Mathematical statistics; and Mathematics, and 1 other area of study.