MATH 3330
Applied Graph Theory
Lec 01 selected
An introduction to graph theory and the analysis of networked data. The course covers logical reasoning about graph concepts including: paths and cycles, shortest route problem, connectivity, minimum spanning trees, network flow, matchings, graph colouring. The course also teaches computational analysis of networks and concepts such as: clustering coefficient, centrality, communities, modularity.
Sections
Lecture
Lec 01
Mon, Wed, Fri 9:35-10:25
From the syllabus
From the Fall 2024 syllabus by Jeannette Janssen. Fall 2026 is taught by Brown J., so details may differ. Open the PDF
Grading
15%Workbooks (10)
15%Theory questions (10)
20%Midterm examOctober 25
50%Final examScheduled during exam period
Textbook
- A First Course in Graph Theory, Gary Chartrand and Ping Zhang (optional)
Course rules
- Late work
- Workbooks and assignments submitted within 24 hours after the deadline receive a 10% penalty.
- Late workbooks
- Students may submit up to two very late workbooks by December 4 at midnight.
- Missed assignments
- For a valid reason, contact the instructor within 24 hours after the deadline; no more than two assignments may be missed this way.
- Missed midterm
- For a valid reason, the midterm weight moves to the final exam.
- Missed final
- Contact the instructor to schedule a make-up exam.
- Exam notice
- Contact the instructor before the exam starts if unable to attend; otherwise the exam is counted as zero.
- Exam materials
- Exams are closed book; students may use one letter-sized crib sheet.
- Collaboration
- Assignments may be discussed, but final solutions must be completed individually; exams permit no collaboration.
- Assignment format
- Theory answers must be submitted as legible PDFs with sufficient explanation.
Have a more recent syllabus for MATH 3330? Sign in to share it