Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

From Wolfram Alpha :

A simple graph, also called a strict graph, is an unweighted, undirected graph containing no graph loops or multiple edges. Unless stated otherwise, the unqualified term "graph" usually refers to a simple graph. A simple graph with multiple edges is sometimes called a multigraph.

What does multiple edges mean here ? And does graph loop mean self loops ?

Most reasonable graphs will contain more than one edges. So I am a little bit confused with the term multiple edges.

share|cite|improve this question
@draks thanks for that link . But I think the term multiple edges is confusing . Parallel edges gives a more intuitive feel of the definition. – Geek Sep 27 '12 at 8:06
but the edges (shown below) are not parallel...;-) – draks ... Sep 27 '12 at 9:13
up vote 3 down vote accepted

$\phantom{30 characters for acceptance.......}$enter image description here

share|cite|improve this answer
...two or more edges that are incident to the same two vertices. – draks ... Sep 27 '12 at 8:05

multiple edges are also known as parallel edges. multiple edges are two or more edges that are incident on the same set of two vertices in a graph.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.