In-degree

In graph theory, the in-degree ^[1] of a vertex $v$ in a directed graph $G$ is the number of directed edges with $v$ as head. Its counterpart is the out-degree, the number of directed edges with $v$ as tail.

Definition

---

Definition 1 (In-degree)

Let $G=(V,E)$ be a directed graph and $v\in V$ a vertex. The in-degree of $v$ is the number of directed edges in $E$ with $v$ as head.

Notation

---

The in-degree of $v$ is denoted ${\mathrm{deg}}^{-}(v)$.

References

1. [1]

   “Indegree and outdegree”, Wikipedia, Available: https://en.wikipedia.org/wiki/Directed_graph#Indegree_and_outdegree, Accessed: 2026-07-31 ↩