Fall 2017 - MATH 345 D100
Introduction to Graph Theory (3)
Class Number: 1339
Delivery Method: In Person
Overview
-
Course Times + Location:
Sep 5 – Dec 4, 2017: Mon, Fri, 3:30–4:20 p.m.
BurnabySep 5 – Dec 4, 2017: Wed, 3:30–4:20 p.m.
Burnaby -
Exam Times + Location:
Dec 16, 2017
Sat, 8:30–11:30 a.m.
Burnaby
-
Instructor:
Luis Goddyn
goddyn@sfu.ca
1 778 782-4699
-
Prerequisites:
MACM 201 (with a grade of at least B-).
Description
CALENDAR DESCRIPTION:
Fundamental concepts, trees and distances, matchings and factors, connectivity and paths, network flows, integral flows. Quantitative.
COURSE DETAILS:
- Graph Basics
- Trees
- Matchings
- Connectivity
- Directed Graphs
- Advanced topics (time permitting)
Grading
- Midterms 50%
- Final Exam 50%
NOTES:
THE INSTRUCTOR RESERVES THE RIGHT TO CHANGE ANY OF THE ABOVE INFORMATION.
Students should be aware that they have certain rights to confidentiality concerning the return of course papers and the posting of marks.
Please pay careful attention to the options discussed in class at the beginning of the semester.
Materials
REQUIRED READING:
No textbook required.
RECOMMENDED READING:
Introduction to Graph Theory
Douglas B. West
2/E, Pearson
ISBN: 9780130144003
Registrar Notes:
SFU’s Academic Integrity web site http://students.sfu.ca/academicintegrity.html is filled with information on what is meant by academic dishonesty, where you can find resources to help with your studies and the consequences of cheating. Check out the site for more information and videos that help explain the issues in plain English.
Each student is responsible for his or her conduct as it affects the University community. Academic dishonesty, in whatever form, is ultimately destructive of the values of the University. Furthermore, it is unfair and discouraging to the majority of students who pursue their studies honestly. Scholarly integrity is required of all members of the University. http://www.sfu.ca/policies/gazette/student/s10-01.html
ACADEMIC INTEGRITY: YOUR WORK, YOUR SUCCESS