betaFeedback

WorksMathematics

Generalizing Praeger–Xu graphs

Abstract

We uniformly study directed Praeger–Xu graphs and Praeger's generalized family PX⁡→(Γ,r,s)\overrightarrow{\operatorname{PX}}(Γ,r,s), without requiring that s∣rs\mid r and ΓΓ is an undirected graph. Assuming that Γ×K→2Γ\times\overrightarrow{K}_2 is connected, we determine the full automorphism group of PX⁡→(Γ,r,s)\overrightarrow{\operatorname{PX}}(Γ,r,s) for every rr and ss, prove connectivity, characterize vertex-transitivity, and give an equivalent criterion for tt-arc-transitivity. We also study when PX⁡→(Γ,r,s)\overrightarrow{\operatorname{PX}}(Γ,r,s) is a Cayley graph. We also give two applications. First, we give a new family of twin-free connected arc-transitive digraphs of valency 44 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.

Paper details

vlnc:W_4rw8vzrz
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…