Is there a rule for the order of indegree-outdegree pairs of a directed graph degree sequence?

165 Views Asked by At

Wikipedia (https://en.wikipedia.org/wiki/Directed_graph#Degree_sequence) says that the following directed graph:

enter image description here

has the following degree sequence (list of indegree, outdegree pairs):

$$\{(2, 0), (2, 2), (0, 2), (1, 1)\}$$

My question is, what makes $(2,0)$ come first? Could the first pair be $(2,2)$, e.g.:

$$\{(2, 2), (2, 0), (0, 2), (1, 1)\}$$

?

It is also written that:

The degree sequence is a directed graph invariant so isomorphic directed graphs have the same degree sequence.

If there's no rule for the order of pairs, does it mean that a degree sequence $\{(2, 0), (2, 2), (0, 2), (1, 1)\}$ would be considered the same as the sequence $\{(2, 2), (2, 0), (0, 2), (1, 1)\}$ ? I guess no.

Thank you for your attention.