Definition:Minimum Degree

From ProofWiki
Jump to navigation Jump to search

Definition

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


Then the minimum degree of $G$ is:

$\map \delta G = \min \set {\map {\deg_G} v : v \in V}$


That is, it is the minimum degree of all the vertices of $G$.

Sources