1
$\begingroup$

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.

$\endgroup$
  • 3
    $\begingroup$ en.wikipedia.org/wiki/Multiple_edges $\endgroup$ – draks ... Sep 27 '12 at 8:02
  • $\begingroup$ @draks thanks for that link . But I think the term multiple edges is confusing . Parallel edges gives a more intuitive feel of the definition. $\endgroup$ – Geek Sep 27 '12 at 8:06
  • $\begingroup$ but the edges (shown below) are not parallel...;-) $\endgroup$ – draks ... Sep 27 '12 at 9:13
4
$\begingroup$

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

| cite | improve this answer | |
$\endgroup$
  • $\begingroup$ ...two or more edges that are incident to the same two vertices. $\endgroup$ – draks ... Sep 27 '12 at 8:05
4
$\begingroup$

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.

| cite | improve this answer | |
$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

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