Skip to search formSkip to main contentSkip to account menu

Multiple edges

Known as: Multi-edge, Multiple edge, Parallel edges 
In graph theory, multiple edges (also called parallel edges or a multi-edge), are two or more edges that are incident to the same two vertices. A… 
Wikipedia (opens in a new tab)

Related topics

Related topics

13 relations
Dipole graphDowling geometryFlip graphGraph (discrete mathematics)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Hitting Forbidden Minors: Approximation and Kernelization
We study a general class of problems called F-Deletion problems. In an F-Deletion problem, we are asked whether a subset of at… 
Highly Cited
2009
Highly Cited
2009
Graph Sparsification in the Semi-streaming Model
Analyzing massive data sets has been one of the key motivations for studying streaming algorithms. In recent years, there has… 
Highly Cited
2009
Highly Cited
2009
Spontaneous twist and intrinsic instabilities of pristine graphene nanoribbons
In pristine graphene ribbons, disruption of the aromatic bond network results in depopulation of covalent orbitals and tends to… 
Highly Cited
2005
Highly Cited
2005
Trusted Grid Computing with Security Binding and Trust Integration
Trusted Grid computing demands robust resource allocation with security assurance at all resource sites. Large-scale Grid… 
Highly Cited
2001
Highly Cited
2001
A Sharp Upper Bound of the Spectral Radius of Graphs
Let G be a simple connected graph with n vertices and m edges. Let ?(G)=? be the minimum degree of vertices of G. The spectral… 
Review
1998
Review
1998
On graphs with three eigenvalues
Highly Cited
1995
Highly Cited
1995
A portion of the well-known collaboration graph
The following definitions are probably well-known among many research mathematicians. The collaboration graph C has as vertices… 
Highly Cited
1985
Highly Cited
1985
Permanental roots and the star degree of a graph
Highly Cited
1983
Highly Cited
1983
Network reliability and the factoring theorem
In network reliability analysis, an important problem is to determine the probability that a specified subset of vertices in an… 
Highly Cited
1973
Highly Cited
1973
Algorithms for constructing graphs and digraphs with given valences and factors
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)