Vertex-Transitive Graphs with Arbitrarily Large Vertex-Stabilizer

M. Conder and C. Walker

Abstract

A construction is given for an infinite family ${Gamma_n}$ of the finite vertex-transitive non-Cayley graphs of fixed valency with the property that the order of the vertex-stabilizer in the smallest vertex-transitive group of automorphisms of $Gamma_n$ is a strictly increasing function of $n$. For each $n$ the graph is 4-valent and arc-transitive, with automorphism grou a symmetric group of large prime degree $p>2^{{n+2}}$. The construction uses Sierpinski's gasket to produce generating permutations fo the vertex-stablilizer (a large 2-group).

Keywords

Math Review Classification

Last Updated
2/4/97

Length

Availability
This article is available in:

• 355.ps.gz