Important:The networks package has been deprecated. Use the superseding command GraphTheory[MinimumDegree]instead.

The total number of edges (undirected, including loops) incident at each vertex is computed, and the minimum of these values is returned.

If a name vname is specified it is assigned the name of a vertex of minimum degree.

This routine is normally loaded via the command with(networks) but may also be referenced using the full name networks[mindegree](...).

$\mathrm{with}\left(\mathrm{networks}\right)\:$

$G≔\mathrm{complete}\left(4\right)\:$

$\mathrm{addedge}\left(\left[\left\{1\right\}\,\left\{1\right\}\,\left\{2\right\}\,\left\{3\right\}\,\left\{4\right\}\right]\,G\right)$

$\mathrm{e7},\mathrm{e8},\mathrm{e9},\mathrm{e10},\mathrm{e11}$

$\mathrm{maxdegree}\left(G\,\mathrm{large}\right)$

$5$

$\mathrm{large}$

$1$

$\mathrm{mindegree}\left(G\,\mathrm{small}\right)$

$4$

$\mathrm{small}$

$2$