Degree sequence ($\mathbf{d}=(d_1,\dots ,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.