Graph Theory
Subject MAST30011 (2010)
Note: This is an archived Handbook entry from 2010.
Credit Points: | 12.50 | ||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Level: | 3 (Undergraduate) | ||||||||||||
Dates & Locations: | This subject has the following teaching availabilities in 2010: 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 | ||||||||||||
Prerequisites: |
One of and any other second year level subject from the Department of Mathematics and Statistics | ||||||||||||
Corequisites: | None | ||||||||||||
Recommended Background Knowledge: | None | ||||||||||||
Non Allowed Subjects: | None | ||||||||||||
Core Participation Requirements: | It is University policy to take all reasonable steps to minimise the impact of disability upon academic study and reasonable steps will be made to enhance a student's participation in the University's programs. Students who feel their disability may impact upon their active and safe participation in a subject are encouraged to discuss this with the relevant subject coordinator and the Disability Liaison Unit. |
Subject Overview: |
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 |
---|---|
Objectives: |
On completion of this subject, students should:
|
Assessment: |
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%). |
Prescribed Texts: | None |
Recommended Texts: |
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 |
Generic Skills: |
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. |
Related Course(s): |
Bachelor of Science |
Related Majors/Minors/Specialisations: |
Applied Mathematics Mathematics && Statistics Major Mathematics and Statistics (Applied Mathematics specialisation) Mathematics and Statistics (Discrete Mathematics specialisation) Mathematics and Statistics (Pure Mathematics specialisation) Operations Research / Discrete Mathematics Pure Mathematics |
Download PDF version.