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

<record version="5" id="781">
 <title>pseudograph</title>
 <name>Pseudograph</name>
 <created>2001-11-12 17:41:35</created>
 <modified>2006-08-25 20:10:04</modified>
 <type>Definition</type>
 <creator id="13753" name="Mathprof"/>
 <author id="13753" name="Mathprof"/>
 <author id="76" name="digitalis"/>
 <classification>
	<category scheme="msc" code="05C75"/>
 </classification>
 <related>
	<object name="Graph"/>
	<object name="Multigraph"/>
	<object name="LoopOfAGraph"/>
	<object name="Subgraph"/>
	<object name="GraphHomomorphism"/>
 </related>
 <keywords>
	<term>graph</term>
 </keywords>
 <preamble>\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}
\usepackage{graphicx}
\usepackage{xypic}</preamble>
 <content>A \emph{pseudograph} is a graph that allows both parallel edges and loops.
Formally, $G=(V, E)$ is a pseudograph , if $E$ is a multiset $(V^{(2)}, f)$
where $V^{(2)}$ is the set of unordered pairs of $V$.</content>
</record>
