UnitLevel 3Undergraduate

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 2020 in Semester 2 at Clayton. It needs FIT2014, MTH1035, MTH2140, MTH3110, MTH2025, MTH3121, MTH2121 or MTH3140 and unlocks 2 units.

Credit points
6
Offered in 2020
Semester 2
Clayton
Assessment
Exam 60%
and 1 other task

This is the 2020 handbook entry. See the 2027 entry.

Reviews

No reviews yet

No reviews yet. Be the first to review MTH3170.

Requisites

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 2020

Teaching periodCampusMode
Second semesterClaytonOn campus

Assessment

  • In-semester assessmentThreshold hurdle
    40%
  • Examination (3 hours and 10 minutes)Threshold hurdle
    60%

Learning outcomes

When you finish this unit, you should be able to:

  1. 1

    Apply the basic concepts of graph theory.

  2. 2

    Demonstrate the importance and breadth of applications of graph theory in mathematics and the sciences, especially computer science.

  3. 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. 4

    Construct and write mathematical proofs of theorems about graphs.

  5. 5

    Execute, analyse and prove correctness of algorithms for solving various graph optimisation problems.

  6. 6

    Demonstrate advanced problem solving skills, both individually and collectively with staff and fellow students.

  7. 7

    Demonstrate advanced skills in the written and oral presentation of mathematical arguments.

Workload and teaching

  • Lectures36 hours
  • Applied sessions24 hours
  • Teaching approachActive learning
  • Three 1-hour lectures per week
  • One 2-hour applied class per week
  • Seven hours of independent study per week

Active learning will occur in lectures and applied classes.

Learning resources

Recommended resources

Gary Chartrand and Linda Lesniak, Graphs and digraphs

Reinhard Diestel, Graph Theory [http://diestel-graph-theory.com/index.html]

Adrian Bondy and U.S.R. Murty, Graph Theory with Applications

Where it fits

MTH3170 is part of 9 areas of study in the 2020 handbook.

Contacts

Unit Coordinators
Professor David Wood
Chief Examiners
Professor David Wood

Common questions

What are the prerequisites for MTH3170?

You need FIT2014, MTH1035, MTH2140, MTH3110, MTH2025, MTH3121, MTH2121 or MTH3140 before you enrol.

What can I take after MTH3170?

MTH3170 is a prerequisite or corequisite for 2 units, including MTH4151 and MTH5151.

When is MTH3170 offered?

In 2020, MTH3170 runs in Semester 2 at Clayton.

Does MTH3170 have an exam?

Yes. The exam is worth 60% of the final mark, alongside 1 other task.

Which majors and minors include MTH3170?

MTH3170 is part of Advanced computer science, Applied mathematics, Computational science, Mathematical statistics and Mathematics, and 1 other area of study.

More details

Credit points
6
Level
3
Study level
Undergraduate
Faculty
Faculty of Science
Organisational unit
School of Mathematics
Type
Coursework
EFTSL
0.125
Student contribution
SCA Band 2
Study abroad
Not available