Definition:Neighborhood (Graph Theory)

Definition
Let $G = \struct {V, E}$ be a graph.

Let $v \in V$ be a vertex of $G$.

The neighborhood of $v$ in $G$ is:


 * $\map {\Gamma_G} v = \set {u \in V : u v \in E}$

That is, it is the set of all vertices which are adjacent to $v$.