Hostname: page-component-745bb68f8f-g4j75 Total loading time: 0 Render date: 2025-01-14T11:51:21.991Z Has data issue: false hasContentIssue false
  • English
  • Français

TETRAVALENT ARC-TRANSITIVE GRAPHS WITH UNBOUNDED VERTEX-STABILIZERS

Part of: Permutation groups

Published online by Cambridge University Press:  15 March 2011

PRIMOŽ POTOČNIK ,
PABLO SPIGA  and
GABRIEL VERRET
PRIMOŽ POTOČNIK
Affiliation:
Faculty of Mathematics and Physics, University of Ljubljana, Jadranska 19, 1000 Ljubljana, Slovenia (email: [email protected])
PABLO SPIGA*
Affiliation:
School of Mathematics and Statistics, The University of Western Australia, Crawley, WA 6009, Australia (email: [email protected])
GABRIEL VERRET
Affiliation:
Institute of Mathematics, Physics, and Mechanics, Jadranska 19, 1000 Ljubljana, Slovenia (email: [email protected])
*
✉For correspondence; e-mail: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

It has long been known that there exist finite connected tetravalent arc-transitive graphs with arbitrarily large vertex-stabilizers. However, beside a well-known family of exceptional graphs, related to the lexicographic product of a cycle with an edgeless graph on two vertices, only a few such infinite families of graphs are known. In this paper, we present two more families of tetravalent arc-transitive graphs with large vertex-stabilizers, each significant for its own reason.

Keywords

valency fourarc-transitive

MSC classification

Secondary: 20B25: Finite automorphism groups of algebraic, geometric, or combinatorial structures
Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 84 , Issue 1 , August 2011 , pp. 79 - 89
Copyright
Copyright © Australian Mathematical Publishing Association Inc. 2011

Footnotes

The second author is supported by UWA as part of the Australian Council Federation Fellowship Project FF0776186.

References

[1]Bosma, W., Cannon, J. and Playoust, C., ‘The Magma algebra system. I. The user language’, J. Symbolic Comput. 24(3–4) (1997), 235–265.CrossRefGoogle Scholar
[2]Conder, M. D. E. and Walker, C. G., ‘Vertex-transitive non-Cayley graphs with arbitrarily large vertex-stabilizer’, J. Algebraic Combin. 8 (1998), 29–38.CrossRefGoogle Scholar
[3]Dixon, J. D. and Mortimer, B., Permutation Groups (Springer, New York, 1996).CrossRefGoogle Scholar
[4]Potočnik, P., Spiga, P. and Verret, G., ‘Bounding the order of the vertex-stabiliser in 3-valent vertex-transitive and 4-valent arc-transitive graphs’, submitted, arXiv:1010.2546.Google Scholar
[5]Praeger, C. E. and Xu, M. Y., ‘A characterization of a class of symmetric graphs of twice prime valency’, European J. Combin. 10 (1989), 91–102.CrossRefGoogle Scholar
[6]Sabidussi, G., ‘Vertex-transitive graphs’, Monatsh. Math. 68 (1961), 426–438.CrossRefGoogle Scholar
[7]Tutte, W. T., ‘A family of cubical graphs’, Proc. Cambridge Philos. Soc. 43 (1947), 459–474.CrossRefGoogle Scholar
[8]Tutte, W. T., ‘On the symmetry of cubic graphs’, Canad. J. Math. 11 (1959), 621–624.Google Scholar