In graph theory, **multiple edges** refer to a situation in a graph where two vertices are connected by more than one edge. This is common in **multigraphs**, which are a type of graph that allows for multiple edges between the same pair of vertices as well as loops (edges that connect a vertex to itself).
Articles by others on the same topic
Multiple edges are distinct edges with the same pair of endpoint vertices in an undirected graph. A multigraph permits them; a simple graph does not. In an orientation of a graph of a multigraph, each such edge receives its own direction, so two of them can supply opposite directed edges between the same vertices.