Bouwer graphs, a term coined here for the first time, are a family of regular graphs which includes members that are symmetric but not arc-transitive. Such graphs are termed 1/2-transitive by Alspach et al. (1994). Bouwer's general construction of such graphs defines a graph B(N, m, n) with N>=2 and m, n>=2 such that 2^m congruent 1 (mod n).

arc-transitive graph | Doyle graph | symmetric graph

GraphData

Izak Zurk Bouwer