From 2361efff9d11b648da86fd9696457acb8950acf1 Mon Sep 17 00:00:00 2001
From: Camil Staps
Date: Tue, 27 Oct 2015 18:08:50 +0100
Subject: Start report practical 1

---
 Practical1/report/notation.tex | 7 +++++++
 1 file changed, 7 insertions(+)
 create mode 100644 Practical1/report/notation.tex

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

diff --git a/Practical1/report/notation.tex b/Practical1/report/notation.tex
new file mode 100644
index 0000000..3458029
--- /dev/null
+++ b/Practical1/report/notation.tex
@@ -0,0 +1,7 @@
+\section{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$.
+
+Finally, We write `m.i.s.' for `maximum independent set' and $\ms(\cdots)$ for its size, the graph's independence number. The size of a graph or an m.i.s. is defined as the number of vertices and is written as $|G|$.
+
-- 
cgit v1.2.3

