Paths and Circuits - Multigraphs

Video 1 of 9 presenting section 4.2 Paths and Circuits from Discrete Mathematics 5th ed by Dossey et al. Multigraphs are a slight generalization of graphs found by allowing for multisets, a set with repeated elements. Allowing for repeated vertices in the 2-element subsets of the vertex set gives us loops, an edge adjacent to the same vertex on both sides. Allowing for repeated elements in the edge set gives us parallel edges, distinct edges that connect the same two vertices.