| Week | Day | Reading | Topic | Notes |
| 1 | T: | Intro, Adjacency matrix | Notes 1 | |
| R: | S(I.1, I.4),BH(1.1-1.4) | |||
| 2 | T: | Cycles, paths, products | Notes 2 | |
| R: | BH(2.3) | Equitable partitions | ||
| 3 | T: | BH(1.8) | Seidel, Godsil-McKay | Notes 3 |
| R: | BH(2.2),S(4.5) | Perron-Frobenius | ||
| 4 | T: | S(I.3),BH(1) | Laplacian | Notes 4 |
| R: | ||||
| 5 | T: | - | ||
| R: | More Laplacian intro | |||
| 6 | T: | |||
| R: | BH(1.3.5) | Matrix Tree Theorem | ||
| 7 | T: | Signless Laplacian | BH(1) | Notes 7 |
| R: | Transition matrix | |||
| 8 | T: | Normalized Laplacian | Notes 8 | |
| R: | ||||
| 9 | T: | S(20-21) | Cheeger inequalities | Notes 9 |
| R: | ||||
| 10 | T: | BH(3.2) | Interlacing | Notes 10 |
| R: | BH(3.6) | Chromatic numbers | ||
| 11 | T: | Shannon capacity | Notes 11 | |
| R: | ||||
| 12 | T: | Graham-Pollak | Notes 12 | |
| R: | ||||
| 13 | T: | Minimum rank and zero forcing | Notes 13 | |
| R: | ||||
| 14 | T: | Rank over F2 | Notes 14 | |
| R: |