Let G = (V(G), E(G)) be a graph. A set S ⊆ E(G) is an edge k-cut in G if the graph G − S = (V(G), E(G) \ S) has at least k connected components. The generalized k-edge connectivity of a graph G, ...

Physics and Python stuff. Most of the videos here are either adapted from class lectures or solving physics problems. I really like to use numerical calculations without all the fancy programming ...