MTH3170 · Monash University
Network mathematics
- Credit points
- 6
- Level
- 3
- Workload
- —
- Faculty
- Science
What it covers
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.
Assessment
| Task | Type | Weight |
|---|---|---|
| Final assessment: Exam (3 hours and 10 minutes) | Examination | 50% |
| Continuous assessment | Demonstration | 50% |
When and where
| Teaching period | Campus | Mode |
|---|---|---|
| Second semester | Clayton | On-campus |