loopless multigraph
Sign in to savethumb|right|A multigraph with multiple edges (red) and several loops (blue). Not all authors allow multigraphs to have loops. In mathematics, and more specifically in graph theory, a multigraph is a graph which is permitted to have multiple edges (also called parallel edges), that is, edges that have the same end nodes. Thus two vertices may be connected by more than one edge.
Article
9 sectionsContents
- Undirected multigraph (edges without own identity)
- Undirected multigraph (edges with own identity)
- Directed multigraph (edges without own identity)
- Directed multigraph (edges with own identity)
- Labeling
- See also
- Notes
- References
- External links
thumb|right|A multigraph with multiple edges (red) and several loops (blue). Not all authors allow multigraphs to have loops. In mathematics, and more specifically in graph theory, a multigraph is a graph which is permitted to have multiple edges (also called parallel edges), that is, edges that have the same end nodes. Thus two vertices may be connected by more than one edge.
There are 2 distinct notions of multiple edges: Edges without own identity: The identity of an edge is defined solely by the two nodes it connects. In this case, the term "multiple edges" means that the same edge can occur several times between these two nodes. Edges with own identity: Edges are primitive entities just like nodes. When multiple edges connect two nodes, these are different edges.