Canonical: https://knowlpedia.com/discrete-structures/vertex-degree/

# Vertex degree

The number of neighbors of a vertex in a simple undirected graph.

The **degree** of a vertex \(v\) in a simple undirected [graph](https://knowlpedia.com/discrete-structures/graph-vertex-edge/) \(G=(V,E)\) is
\[
\deg_G(v)=\bigl|\{w\in V:\{v,w\}\in E\}\bigr|.
\]
It counts the neighbors of \(v\). The degree may be infinite.

## Bounded degree

The graph has **degree bounded by \(\Delta\)** if \(\deg_G(v)\le\Delta\) for every vertex, where \(\Delta\) is a fixed nonnegative integer. A graph can have infinitely many vertices and bounded degree. Requiring each degree to be finite is weaker than requiring one finite bound for all vertices.
