Multigraph

A multigraph with multiple edges (red) and a loop (blue). Not all authors allow multigraphs to have loops.

A multigraph or pseudograph 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. Formally, a multigraph G is an ordered pair G:=(V, E) with

• V a set of vertices or nodes,
• E a multiset of unordered pairs of vertices, called edges or lines.

Multigraphs might be used to model the possible flight connections offered by an airline. In this case the pseudograph would be a directed graph with pairs of directed parallel edges connecting cities to show that it is possible to fly both to and from these locations.

Some authors also allow multigraphs to have loops, that is, an edge that connects a vertex to itself, while others call these pseudographs, reserving the term multigraph for the case with no loops.

A multidigraph is a directed graph which is permitted to have multiple arcs, i.e., arcs with the same source and target nodes. A multidigraph G is an ordered pair G:=(V,A) with

• V a set of vertices or nodes,
• A a multiset of ordered pairs of vertices called directed edges, arcs or arrows.

In category theory a small category can be defined as a multidigraph equipped with an associative composition law and a distinguished self-loop at each vertex serving as the left and right identity for composition. For this reason, in category theory the term graph is standardly taken to mean "multidigraph", and the underlying multidigraph of a category is called its underlying digraph.

A mixed multigraph G:=(V,E, A) may be defined in the same way as a mixed graph.

Labeling

Multigraphs and multidigraphs also support the notion of graph labeling, in a similar way. However there is no unity in terminology in this case.

The definitions of labeled multigraphs and multidigraphs are similar, and we define only the latter ones here.

Definition 1: A labeled multidigraph is a labeled graph with labeled arcs.

Formally: A labeled multidigraph G is a multigraph with labeled nodes and arcs. Formally it is an 8-tuple $G=(\Sigma _{V},\Sigma _{A},V,A,s,t,\ell _{V},\ell _{A})$ where

• V is a set of nodes and A is a multiset of arcs.
• $\Sigma _{V}$ and $\Sigma _{A}$ are finite alphabets of the available node and arc labels,
• $s\colon A\rightarrow \ V$ and $t\colon A\rightarrow \ V$ are two maps indicating the source and target node of an arc,
• $\ell _{V}\colon V\rightarrow \Sigma _{V}$ and $\ell _{A}\colon A\rightarrow \Sigma _{A}$ are two maps describing the labeling of the nodes and edges.

Definition 2: A labeled multidigraph is a labeled graph with multiple labeled edges, i.e. edges with the same end nodes and the same edge label (note that this notion of a labeled graph is different from the notion given by the article graph labeling).

References

• Balakrishnan, V. K.; Graph Theory, McGraw-Hill; 1 edition (February 1, 1997). ISBN 0-07-005489-4.
• Bollobas, Bela; Modern Graph Theory, Springer; 1st edition (August 12, 2002). ISBN 0-387-98488-7.
• Diestel, Reinhard; Graph Theory, Springer; 2nd edition (February 18, 2000). ISBN 0-387-98976-5.
• Gross, Jonathan L, and Yellen, Jay; Graph Theory and Its Applications, CRC Press (December 30, 1998). ISBN 0-8493-3982-0.
• Gross, Jonathan L, and Yellen, Jay; (eds); Handbook of Graph Theory. CRC (December 29, 2003). ISBN 1-58488-090-2.
• Harary, Frank; Graph Theory, Addison Wesley Publishing Company (January 1995). ISBN 0-201-41033-8.
• Zwillinger, Daniel; CRC Standard Mathematical Tables and Formulae, Chapman & Hall/CRC; 31st edition (November 27, 2002). ISBN 1-58488-291-3.
• Svante Janson, Donald E. Knuth, Tomasz Luczak, and Boris Pittel; The Birth of the Giant Component, Random Structures Algorithms 4 (1993), no. 3, 231-358.

External links

•  This article incorporates public domain material from Paul E. Black. "Multigraph". Dictionary of Algorithms and Data Structures. NIST.