Definition
Let $G = \struct {V, E}$ be a graph.
The degree sequence of $G$ is the sequence obtained by listing all the degrees of all the vertices of $G$ in ascending order, with repeats as needed.
Example
The degree sequence of this graph is $\tuple {1, 2, 2, 3, 3, 3, 4}$.
