Graph Theory
Subject 620-352 (2009)
Note: This is an archived Handbook entry from 2009. Search for this in the current handbook
| Credit Points: | 12.50 | ||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Level: | 3 (Undergraduate) | ||||||||||||
| Dates & Locations: | This subject has the following teaching availabilities in 2009: Semester 1, - Taught on campus.
Lectures and practice classes. Timetable can be viewed here. For information about these dates, click here. | ||||||||||||
| Time Commitment: | Contact Hours: 36 one-hour lectures (three per week) and up to 12 one-hour practice classes (one per week) Total Time Commitment: 120 hours total time commitment. | ||||||||||||
| Prerequisites: |
Any two second year level subjects from the Department of Mathematics and Statistics. The computer science subject Algorithms and Data Structures may be substituted for one of these subjects. | ||||||||||||
| 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. |
Coordinator
Prof Aleks Owczarek| Subject Overview: |
This subject introduces the basic concepts of graph theory including isomorphic graphs, subgraphs, connectedness, bipartite graphs, paths and cycles, trees, weighted graphs and distance in graphs, Steiner trees, matchings, flows and eulerian circuits. Students should develop the ability to implement algorithms on graphs for finding objects such as minimum spanning trees, maximum matchings and flows; and to implement approximation algorithms. Students should also develop the ability to prove simple results in graph theory. This subject demonstrates the variety of applications of graph theory within and outside mathematics. Introduction to graph theory topics include the concepts listed above, but may also include colouring properties, combinatorics, and the probabilistic method. |
|---|---|
| Objectives: | . |
| Assessment: |
Up to 24 pages of written assignments due during semester (0% or 10%); a 3-hour written examination in the examination period (90% or 100%). The relative weighting of the examination and the total assignment mark will be chosen so as to maximise the student's final mark. |
| Prescribed Texts: | None |
| 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 |
| Notes: | This subject is available for science credit to students enrolled in the BSc (pre-2008 degree only), BASc or a combined BSc course. |
| Related Majors/Minors/Specialisations: |
Mathematics && Statistics Major Mathematics and Statistics (Applied Mathematics specialisation) Mathematics and Statistics (Discrete Mathematics specialisation) Mathematics and Statistics (Pure Mathematics specialisation) |
Download PDF version.