|
|
|
| Untersuchte Arbeit: Seite: 99, Zeilen: 26-32 |
Quelle: Brandes_Erlebach_2005 Seite(n): 8, Zeilen: 8-14 |
|---|---|
| In both undirected and directed graphs', we may allow the edge set E to contain the same edge several times, that is, E can be a multiset. If an edge occurs several times in E, the copies of that edge are called parallel edges. Graphs with parallel edges are also called multigraphs. A graph is called simple, if each of its edges is contained in E only once, i.e., if the graph does not have parallel edges. An edge joining a vertex to itself, i.e., and edge whose end [vertices are identical, is called a loop.] | In both undirected and directed graphs, we may allow the edge set E to contain the same edge several times, i.e., E can be a multiset. If an edge occurs several times in E, the copies of that edge are called parallel edges. Graphs with parallel edges are also called multigraphs. A graph is called simple, if each of its edges is contained in E only once, i.e., if the graph does not have parallel edges. An edge joining a vertex to itself, i.e., an edge whose endvertices are identical, is called a loop. |
The source is not given. The definitions given here are certainly standard and don't need to be referenced. Nm, however, copied the formulation of those definitions word for word. |
|