Note: This is an archived Handbook entry from 2011.
|Dates & Locations:|| |
This subject has the following teaching availabilities in 2011:Semester 1, Parkville - Taught on campus.
Lectures and practice classes.
Timetable can be viewed here. For information about these dates, click here.
|Time Commitment:||Contact Hours: 3 x one hour lectures per week, 1 x one hour practice class per week |
Total Time Commitment: Estimated total time commitment of 120 hours
Study Period Commencement:
Semester 1, Semester 2
|Recommended Background Knowledge:||None|
|Non Allowed Subjects:||None|
|Core Participation Requirements:||For the purposes of considering request for Reasonable Adjustments under the Disability Standards for Education (Cwth 2005), and Students Experiencing Academic Disadvantage Policy, academic requirements for this subject are articulated in the Subject Description, Subject Objectives, Generic Skills and Assessment Requirements of this entry. |
The University is dedicated to provide support to those with special requirements. Further details on the disability support scheme can be found at the Disability Liaison Unit website: http://www.services.unimelb.edu.au/disability/
CoordinatorAssoc Prof David Wood
Third Year Coordinator
Graphs model networks of all types such as telecommunication, transport, computer and social networks. They also model physical structures such as crystals and abstract structures within computer algorithms.
This subject is an introduction to the modern field of graph theory. It emphasises the relationship between proving theorems in mathematics and the construction of algorithms to find the solutions of mathematical problems within the context of graph theory. The subject provides material that supplements other areas of study such as operations research, computer science and discrete mathematics
On completion of this subject, students should:
Two written assignments due mid-semester and at the end of semester amounting to a total of up to 50 pages (20%), and a 3-hour written examination in the examination period (80%).
G. Chartrand and O.R. Oellerman, Applied and Algorithmic Graph Theory, McGraw-Hill, 1993, Freeman, 1998.
|Breadth Options:|| |
This subject potentially can be taken as a breadth subject component for the following courses:
You should visit learn more about breadth subjects and read the breadth requirements for your degree, and should discuss your choice with your student adviser, before deciding on your subjects.
|Fees Information:||Subject EFTSL, Level, Discipline & Census Date|
In addition to learning specific skills that will assist students in their future careers in science, they will have the opportunity to develop generic skills that will assist them in any future career path. These include:
|Notes:||This subject is available for science credit to students enrolled in the BSc (both pre-2008 and new degrees), BASc or a combined BSc course.|
Bachelor of Science |
Applied Mathematics (specialisation of Mathematics and Statistics major) |
Mathematics and Statistics Major
Operations Research / Discrete Mathematics (specialisation of Mathematics and Statistics major)
Pure Mathematics (specialisation of Mathematics and Statistics major)
Science credit subjects* for pre-2008 BSc, BASc and combined degree science courses
Download PDF version.