The disorder number of a simple connected graph on n 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 n. Fried summarizes values for a number of common graph classes.

average disorder number | walk