GI-graphs: a new class of graphs with many symmetries

The class of generalized Petersen graphs was introduced by Coxeter in the 1950s. Frucht, Graver and Watkins determined the automorphism groups of generalized Petersen graphs in 1971, and much later, Nedela and ?koviera and (independently) Lovre?i?-Sara?in characterised those which are Cayley graphs. In this paper we extend the class of generalized Petersen graphs to a class of GI-graphs. For any positive integer n and any sequence j ₀,j ₁,…,j _t?1 of integers mod n, the GI-graph GI(n;j ₀,j ₁,…,j _t?1) is a (t+1)-valent graph on the vertex set \(\mathbb{Z}_{t} \times\mathbb{Z}_{n}\) , with edges of two kinds:

• an edge from (s,v) to (s′,v), for all distinct \(s,s' \in \mathbb{Z}_{t}\) and all \(v \in\mathbb{Z}_{n}\) ,
• edges from (s,v) to (s,v+j _s ) and (s,v?j _s ), for all \(s \in\mathbb{Z}_{t}\) and \(v \in\mathbb{Z}_{n}\) .

By classifying different kinds of automorphisms, we describe the automorphism group of each GI-graph, and determine which GI-graphs are vertex-transitive and which are Cayley graphs. A GI-graph can be edge-transitive only when t≤3, or equivalently, for valence at most 4. We present a unit-distance drawing of a remarkable GI(7;1,2,3).