The disorder number of a simpleconnected graph on
vertices is defined as the maximum length of a walk along
the edges of the graph taken over all ordering of its vertices from 1 to (Fried 2022).

Fried (2022) summarizes values for a number of common graph classes.