multigraph
Quick Summary
In mathematics, a multigraph is a type of graph that consists of a set of vertices (points) and a set of edges (lines) connecting these vertices. Unlike a simple graph, a multigraph allows for more than one edge to connect any two vertices. It can also include loops, which are edges that connect a vertex to itself.
The concept of multigraphs is fundamental to graph theory, a branch of mathematics that studies networks. Graph theory has applications in various fields, including chemistry, computer science, and operations research. A key problem in graph theory, the Königsberg bridge problem, was solved by Leonhard Euler in 1735 and demonstrated the principles of Eulerian cycles within multigraphs. An Eulerian cycle is a path that traverses each edge exactly once.123
Ask Britannica AI about this topic
Britannica doesn't have a full article on this topic, so we've curated a list of our relevant coverage.
graph theory…the graph is called a multigraph. A graph without loops and with at most one edge between any two vertices is called a simple graph. Unless stated otherwise, graph is assumed to refer to a simple graph. When each vertex is connected by an edge to every other vertex, the…
Read More…the graph is called a multigraph. A graph without loops and with at most one edge between any two vertices is called a simple graph. Unless stated otherwise, graph is assumed to refer to a simple graph. When each vertex is connected by an edge to every other vertex, the…
Read More
combinatoricsEulerian cycles and the Königsberg bridge problemA multigraph G consists of a non-empty set V(G) of vertices and a subset E(G) of the set of unordered pairs of distinct elements of V(G) with a frequency f ≥ 1 attached to each pair. If the pair (x1, x2) with frequency f belongs to…
Read MoreA multigraph G consists of a non-empty set V(G) of vertices and a subset E(G) of the set of unordered pairs of distinct elements of V(G) with a frequency f ≥ 1 attached to each pair. If the pair (x1, x2) with frequency f belongs to…
Read More