Degree sequence
= Degree sequence
{title2=$\mathbf d=(d_1,\ldots,d_n)$}
The degree sequence of a labelled <graph> records the <degree of a vertex> at each label. The <handshaking lemma> gives $\sum_i d_i=2|E|$. A nonincreasing list forgets the assignment of degrees to labels unless a particular ordering is specified.