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

This routine returns a list of vertex degrees sorted into ascending order.

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

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

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

$\mathrm{degreeseq}\left(G\right)$

$\left[3\,3\,3\,3\right]$

$G≔\mathrm{random}\left(5\right)\:$

$\mathrm{ends}\left(G\right)$

$\left\{\left\{1\,2\right\}\,\left\{1\,3\right\}\,\left\{1\,4\right\}\,\left\{2\,3\right\}\,\left\{3\,5\right\}\right\}$

$\mathrm{degreeseq}\left(G\right)$

$\left[1\,1\,2\,3\,3\right]$