From 861a506eb419b4e8a33298d2e67b8b4d9e48b18b Mon Sep 17 00:00:00 2001
From: Camil Staps
Date: Tue, 3 Nov 2015 14:42:30 +0100
Subject: Report organisation practical 1

---
 Practical1/report/notation.tex | 1 +
 1 file changed, 1 insertion(+)

(limited to 'Practical1/report/notation.tex')

diff --git a/Practical1/report/notation.tex b/Practical1/report/notation.tex
index 3458029..07f9a34 100644
--- a/Practical1/report/notation.tex
+++ b/Practical1/report/notation.tex
@@ -1,4 +1,5 @@
 \section{Notation}
+\label{sec:notation}
 I'm largely following Robson's notation \cite{robson}. For a graph $G=(V,E)$ and vertex $v\in V$, and edge $e\in E$, we write $d(v)$ for the degree of the vertex. $N(v)$ is the set of $v$'s neighbours, and $\iN(v)=N(v)\cup\{v\}$, $v$'s `inclusive neighbourhood'. Then $N^2(v)$ is the set of second order neighbours of $v$, excluding $v$: $N^2(v)=\{v_2 \in N(v_1) \mid v_1\in N(v)\} \setminus \{v\}$. If $\iN(v)\subseteq\iN(w)$, $v$ is said to dominate $w$, notation: $v>w$.
 
 We write `subgraph' for `vertex-induced subgraph', and $G\ex U$ for the subgraph induced on $G$ by $U$. For $v\in V$, we write $G\ex v$ for $G\ex\{v\}$. We use $e(v,w)$ for the predicate $(v,w)\in E$. We're strictly talking about non-directed graphs, so this is equivalent with $(w,v)\in E$.
-- 
cgit v1.2.3

