Journal of the Australian Mathematical Society · 2006 · 59 citations · 21 references
Geometric Graph TheoryS -Regular SubgroupGraph TheoryCubic Symmetric GraphsCubic Symmetric GraphStructural Graph TheoryTopological Graph TheoryAlgebraic Graph TheoryFull Automorphism GroupDiscrete MathematicsExtremal Graph Theory
Abstract An automorphism group of a graph is said to be s-regular if it acts regularly on the set of s -arcs in the graph. A graph is s-regular if its full automorphism group is s -regular. For a connected cubic symmetric graph X of order 2 p n for an odd prime p , we show that if p ≠ 5, 7 then every Sylow p -subgroup of the full automorphism group Aut( X ) of X is normal, and if p ≠3 then every s -regular subgroup of Aut( X ) having a normal Sylow p -subgroup contains an ( s − 1)-regular subgroup for each 1 ≦ s ≦ 5. As an application, we show that every connected cubic symmetric graph of order 2 p n is a Cayley graph if p > 5 and we classify the s -regular cubic graphs of order 2 p 2 for each 1≦ s≦ 5 and each prime p . as a continuation of the authors' classification of 1-regular cubic graphs of order 2 p 2 . The same classification of those of order 2 p is also done.
21
On the full automorphism group of a graph
Chris Godsil · COMBINATORICA · 1981 · 303 citations
Graph Theory, Algebraic Graph Theory, Structural Graph Theory +3
Automorphism groups and isomorphisms of Cayley digraphs
Mingyao Xu · Discrete Mathematics · 1998 · 283 citations
On the Symmetry of Cubic Graphs
W. T. Tutte · Canadian Journal of Mathematics · 1959 · 212 citations · Full text
Vertex‐transitive graphs: Symmetric graphs of prime valency
Peter Lorimer · Journal of Graph Theory · 1984 · 181 citations