The group generated by a graph's derangements

Abstract

We introduce the leap group of a graph, the subgroup of the symmetric group on the vertex set generated by graph derangements. We summarize historical results on graph derangements, which we call hops, and prove additional existence and complexity results. The leap groups of various canonical graphs are computed, and their behavior under basic graph operations is analyzed. We offer partial results on which groups can appear as leap groups, and study hops and leaps for infinite and directed graphs.

arXiv comment24 pages, 8 figures