Disorder Number

The disorder number of a simple connected 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.

Explore with Wolfram|Alpha

More things to try:

12th maxterm in 4 variables
g(0)=1, g(n+1)=n^2+g(n)
local minimum calculator

References

Fried, S. "The Disorder Number of a Graph." 7 Aug 2022. https://arxiv.org/abs/2208.03788/.

Cite this as:

Weisstein, Eric W. "Disorder Number." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/DisorderNumber.html

Disorder Number

See also

Explore with Wolfram|Alpha

References

Cite this as:

Subject classifications