WorksMathematics
Generalizing Praeger–Xu graphs
Abstract
We uniformly study directed Praeger–Xu graphs and Praeger's generalized family , without requiring that and is an undirected graph. Assuming that is connected, we determine the full automorphism group of for every and , prove connectivity, characterize vertex-transitivity, and give an equivalent criterion for -arc-transitivity. We also study when is a Cayley graph. We also give two applications. First, we give a new family of twin-free connected arc-transitive digraphs of valency whose vertex stabilizers have exponential growth. We also give a connected regular digraph that is not vertex-transitive but whose direct product with a directed cycle is Cayley.