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

<record version="7" id="2754">
 <title>subgraph</title>
 <name>Subgraph</name>
 <created>2002-03-06 23:50:50</created>
 <modified>2007-10-08 17:31:44</modified>
 <type>Definition</type>
 <creator id="3771" name="CWoo"/>
 <author id="3771" name="CWoo"/>
 <author id="348" name="bbukh"/>
 <author id="76" name="digitalis"/>
 <classification>
	<category scheme="msc" code="05C99"/>
 </classification>
 <defines>
	<concept>induced</concept>
	<concept>spanned by</concept>
	<concept>spanning</concept>
	<concept>spanning subgraph</concept>
	<concept>induced subgraph</concept>
 </defines>
 <related>
	<object name="Graph"/>
	<object name="Pseudograph"/>
	<object name="Multigraph"/>
 </related>
 <keywords>
	<term>graph</term>
 </keywords>
 <preamble>% this is the default PlanetMath preamble.  as your knowledge
% of TeX increases, you will probably want to edit this, but
% it should be fine as is for beginners.

% almost certainly you want these
\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}

% used for TeXing text within eps files
%\usepackage{psfrag}
% need this for including graphics (\includegraphics)
%\usepackage{graphicx}
% for neatly defining theorems and propositions
%\usepackage{amsthm}
% making logically defined graphics
%\usepackage{xypic} 

% there are many more packages, add them here as you need them

% define commands here</preamble>
 <content>We say that $G' = (V',E')$ is a \emph{subgraph} of $G = (V,E)$ if $V' \subseteq V$ and $E' \subseteq E$. In this case we write $G' \subseteq G$.

If $G'$ contains \emph{all edges} of $G$ that join two vertices in $V'$ then $G'$ is said to be the subgraph \emph{induced} or \emph{spanned by} $V'$ and is denoted by $G[V']$. Thus, a subgraph $G'$ of $G$ is an induced subgraph if $G' = G[V(G')]$. If $V' = V$, then $G'$ is said to be a \emph{spanning} subgraph of $G$.

Often, new graphs are constructed from old ones by deleting or adding some vertices and edges. If $W \subset V(G)$, then $G - W = G[V\setminus W]$ is the subgraph of $G$ obtained by deleting the vertices in $W$ \emph{and all edges incident with them}. Similarly, if $E' \subseteq E(G)$, then $G - E' = (V(G),E(G) \setminus E')$. If $W = {w}$ and $E' = {xy}$, then this notation is simplified to $G - w$ and $G - xy$. Similarly, if $x$ and $y$ are nonadjacent vertices of $G$, then $G + xy$ is obtained from $G$ by joining $x$ to $y$.


\footnotesize{Adapted with permission of the author from \emph{\PMlinkescapetext{Modern Graph Theory}} by B\'{e}la Bollob\'{a}s, published by Springer-Verlag New York, Inc., 1998.}</content>
</record>
