Monash University Computing & Information Technology handbook 1995

Copyright © Monash University 1995
Enquiries to publishing@udev.monash.edu.au

MAT1130

Graphs, logic and numbers

J Stillwell

6 points * Three 1-hour lectures per week, including practical work * First/Second semester * Clayton * Prohibitions: MAT1470, MAT1711, MAT1722

Topics in graph theory, combinatorics and number theory, to include the following: graphs, paths and trees; the Euler polyhedron formula and planar graphs; induction and recurrence relations; Boolean algebra; divisors, prime numbers and the Euclidean algorithm; the theorems of Fermat and Euler; Diophantine equations.

Assessment

Examination (2 hours): 85% * Assignments: 15%

Prescribed texts

Chartrand G Introductory graph theory Dover, 1985

Recommended texts

Hausner M Discrete mathematics HBJ, 1992

Ore O Number theory and its history Dover, 1988

Walter R F C Number theory: An introduction Carslaw, 1987

Wilson R J and Watkins J J Graphs: An introductory approach Wiley, 1990

Recommended texts

Feller W An introduction to probability theory and its applications vol. 1, 3rd edn, Wiley, 1968


Return to subject list Return to computing handbook contents Return to the list of Monash handbooks