<?xml version="1.0" encoding="UTF-8"?>

<record version="6" id="1615">
 <title>loop</title>
 <name>LoopOfAGraph</name>
 <created>2002-01-25 18:04:24</created>
 <modified>2003-08-21 04:13:15</modified>
 <type>Definition</type>
<parent id="777">graph</parent>
 <creator id="3" name="drini"/>
 <author id="1182" name="Larry Hammick"/>
 <author id="76" name="digitalis"/>
 <classification>
	<category scheme="msc" code="05C99"/>
	<category scheme="msc" code="20N05"/>
 </classification>
 <related>
	<object name="Graph"/>
	<object name="Pseudograph"/>
	<object name="Quasigroup"/>
 </related>
 <preamble>\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}</preamble>
 <content>\PMlinkescapeword{joins}
\PMlinkescapeword{contain}
In graph theory, a \emph{loop} is an edge which joins a vertex
to itself, rather than to some other vertex. By definition,
a graph cannot contain a loop; a pseudograph, however, may contain
both multiple edges and multiple loops. Note that by some definitions,
a multigraph may contain multiple edges and no loops, while other texts
define a multigraph as a graph
allowing multiple edges and multiple loops.

In algebra, a \emph{loop} is a quasigroup which contains an identity element.</content>
</record>
