Author: Suman Ganguli (Page 2 of 7)

Here is the schedule for the next week–for Exam #2, I will distribute a set of take-home exercises tomorrow (Wednesday, 4/23), to be handed in next Monday. There will also be a short in-class exam on Monday, similar to the take-home; the take-home and in-class exercises will each be 50% of Exam #2:

Also, as noted above and announced in class, I will collect Sec 10.3, #8 (writing down the adjacency matrix for the graph in #4) tomorrow. We worked through #7 in class together, after reviewing and introducing adjacency lists and adjacency matrices:

We reintroduced the “Bridges of Konigsburg” problem above, which Euler formulated in the late 1700s and led to the development of graph theory, by looking at this video:

A reminder that the slides for Ch 10 are available as a pdf in OpenLab Files.

Mon, April 7: We discussed Q_n (the n-dimensional hypercube), and introduced bipartite graphs. You should read Sec 10.2.5 of the textbook, including Examples 11-15, on bipartite graphs. See below also for a schedule for the rest of the semester:

Wed, April 9: We introduced some python code, specifically the networkx package for working with graphs (or networks). I showed some code in Anaconda/Jupyter; you can see my Jupyter notebook here. Alternatively, you can see some code in CoCalc here. (Other Python platforms people in class mentioned are Colab, PyCharm, and VSCode.)

We also briefly introduced adjacency lists and adjacency matrices, from Sec 10.3.