dc.contributor.author |
Conder, M. |
en |
dc.contributor.author |
Walker, C. |
en |
dc.date.accessioned |
2009-08-28T03:22:03Z |
en |
dc.date.available |
2009-08-28T03:22:03Z |
en |
dc.date.issued |
1997-04 |
en |
dc.identifier.citation |
Department of Mathematics - Research Reports-355 (1997) |
en |
dc.identifier.issn |
1173-0889 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/5074 |
en |
dc.description.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). |
en |
dc.publisher |
Department of Mathematics, The University of Auckland, New Zealand |
en |
dc.relation.ispartofseries |
Research Reports - Department of Mathematics |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.source.uri |
http://www.math.auckland.ac.nz/Research/Reports/view.php?id=355 |
en |
dc.title |
Vertex-Transitive Graphs with Arbitrarily Large Vertex-Stabilizer |
en |
dc.type |
Technical Report |
en |
dc.subject.marsden |
Fields of Research::230000 Mathematical Sciences::230100 Mathematics |
en |
dc.rights.holder |
The author(s) |
en |