Graph Terminology I

Adjacency

For an edge $e = (u, v)$ that connects node $u$ to node $v$, we say that $v$ is adjacent to $u$, or that $v$ is a neighbor of $u$. The edge $e$ is called incident to both $u$ and $v$.

The number of neighbors of a node $v$ is called the degree of $v$, written deg($v$ ...