On a conjecture of McNeil

arXiv2208.03788MaRDI QIDQ6407216FDOQ6407216

Publication date: 7 August 2022

Abstract: We define the disorder number of a graph as the maximal length of a walk along the edges of the graph, according to any ordering of its vertices. We then reformulate, from this graph theory point of view, the known results regarding the few special cases that were previously studied, putting them thereby in a unifying context. We study, seemingly for the first time, the disorder number of the cycle graph and of the grid graph of arbitrary size.

This page was built for publication: On a conjecture of McNeil

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6407216)