networks(deprecated)/mindegree - Maple Help

networks

 mindegree
 finds minimum vertex degree in a graph

 Calling Sequence mindegree(G) mindegree(G, vname)

Parameters

 G - graph or network vname - vertex of minimum degree (returned)

Description

 • 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](...).

Examples

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

 > $\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}}$ (1)
 > $\mathrm{maxdegree}\left(G,\mathrm{large}\right)$
 ${5}$ (2)
 > $\mathrm{large}$
 ${1}$ (3)
 > $\mathrm{mindegree}\left(G,\mathrm{small}\right)$
 ${4}$ (4)
 > $\mathrm{small}$
 ${2}$ (5)