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.

We continued discussing Sec 10.2, specifically “special” types of graphs (complete graphs K_n, cyclic graph C_n, “wheels” W_n), and bipartite graphs. We also did a quiz, covering some of the basic terms and ideas from Sec 10.1.

Please continue working on HW#3, which is due next Wednesday (April 9 — which is the last class before Spring Break); note that I added a couple more Sec 10.2 exercises (in bold) to the previously announced list:

• Sec 10.1: #3-9
• Sec 10.2: #1-4, 7-9, 12, 20, 21-23

The slides for Ch 10 are available as a pdf in OpenLab Files.

We will have another short in-class quiz on Monday, which will cover some more of the basic concepts from Sec 10.1 and 10.2 (similar to the HW exercises). I will also accept any additional Exam #1 corrections on Monday.

(You can see the page I showed about the “Hub-spoke network topology in Azure“; you can also look at the wikipedia page for “Spoke–hub distribution paradigm“)