Loading AI tools
In graph theory, edges incident/directed between the same vertices From Wikipedia, the free encyclopedia
In graph theory, multiple edges (also called parallel edges or a multi-edge), are, in an undirected graph, two or more edges that are incident to the same two vertices, or in a directed graph, two or more edges with both the same tail vertex and the same head vertex. A simple graph has no multiple edges and no loops.
Depending on the context, a graph may be defined so as to either allow or disallow the presence of multiple edges (often in concert with allowing or disallowing loops):
Multiple edges are, for example, useful in the consideration of electrical networks, from a graph theoretical point of view.[3] Additionally, they constitute the core differentiating feature of multidimensional networks.
A planar graph remains planar if an edge is added between two vertices already joined by an edge; thus, adding multiple edges preserves planarity.[4]
A dipole graph is a graph with two vertices, in which all edges are parallel to each other.
Seamless Wikipedia browsing. On steroids.
Every time you click a link to Wikipedia, Wiktionary or Wikiquote in your browser's search results, it will show the modern Wikiwand interface.
Wikiwand extension is a five stars, simple, with minimum permission required to keep your browsing private, safe and transparent.