Formula omitted]-regular families of graph automorphisms

Abstract

An r-regular family F of permutations on a set V contains, for each pair of vertices u,v∈V, exactly r permutations φ mapping u to v. Earlier, 1-regular families of graph automorphisms were used by Gauyacq to define the quasi-Cayley graphs, a class of vertex-transitive graphs that properly contains the class of Cayley graphs, sharing many of their characteristics, and is properly contained in the class of vertex-transitive graphs. We introduce r-regular families to measure how far a vertex-transitive graph is from being quasi-Cayley. As any automorphism group of a graph Γ=(V,E) acting transitively on V with vertex-stabilizers of order r forms an r-regular family on V, every vertex-transitive graph admits an r-regular family of automorphisms for some r≥1. In general, the smallest r for which such a family exists (which we call the quasi-Cayley deficiency of the graph) might be smaller than the order of the vertex-stabilizer of a smallest vertex-transitive automorphism group of the graph (which we call the Cayley deficiency). We investigate the relations between these two parameters for the class of merged Johnson graphs. We prove the existence of Johnson graphs with arbitrarily large quasi-Cayley deficiency, as well as Johnson graphs for which the difference between their Cayley deficiency and their quasi-Cayley deficiency is arbitrarily large.