Hostname: page-component-8448b6f56d-c47g7 Total loading time: 0 Render date: 2024-04-24T05:03:10.325Z Has data issue: false hasContentIssue false
  • English
  • Français

Classification of 4- and 5-arc-transitive cubic graphs of small girth

Part of: Special aspects of infinite or finite groups Graph theory

Published online by Cambridge University Press:  09 April 2009

Margaret J. Morton
Margaret J. Morton
Affiliation:
University of AucklandPrivate Bag Auckland, New Zealand
Rights & Permissions [Opens in a new window]

Extract

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.

This paper classifies all finite connected 4- and 5-arc-transitive cubic graphs that contain circuits of length less than or equal to 11, or of length 13, and some of those graphs with circuits of length 12.

MSC classification

Secondary: 05C25: Graphs and abstract algebra (groups, rings, fields, etc.) 20F05: Generators, relations, and presentations
Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 50 , Issue 1 , February 1991 , pp. 138 - 149
Copyright
Copyright © Australian Mathematical Society 1991

References

[1]Biggs, N. and Hoare, M., ‘The sextet construction for cubic graphs’, Combinatorica 3 (1983), 153–165.CrossRefGoogle Scholar
[2]Biggs, N., ‘Presentations for cubic graphs’, Computational Group Theory, edited by Atkinson, M., pp. 57–63 (Academic Press, London, 1984).Google Scholar
[3]Cannon, J., ‘Software tools for group theory’, Proc. Sympos. Pure Math. 37 (1980), 495–502.CrossRefGoogle Scholar
[4]Conder, M., ‘An infinite family of 4-arc-transitive cubic graphs each with girth 12’, Bull. London Math. Soc. 21 (1989), 375–380.CrossRefGoogle Scholar
[5]Conder, M., ‘An infinite family of 5-arc-transitive cubic graphs’, Ars Combin. 25A (1988), 95–108.Google Scholar
[6]Conder, M. and Lorimer, P., ‘Automorphism groups of symmetric graphs of valency 3’, J. Combin. Theory Ser. B, to appear.Google Scholar
[7]Djokovic, D. and Miller, G., ‘Regular groups of automorphisms of cubic graphs’, J. Combin. Theory Ser. B 29 (1980), 195–230.CrossRefGoogle Scholar
[8]Lorimer, P., ‘Vertex transitive graphs: symmetric graphs of prime valency’, J. Graph Theory 8 (1984), 55–68.CrossRefGoogle Scholar
[9]Tutte, W., ‘A family of cubical graphs’, Proc. Cambridge Philos. Soc. 43 (1947), 459–474.CrossRefGoogle Scholar
[10]Tutte, W., ‘On the symmetry of cubic graphs’, Canad. J. Math. 11 (1959), 621–624.CrossRefGoogle Scholar
[11]Wong, W., ‘Determination of a class of primitive permutation groups’, Math. Z. 99 (1967), 235–246.CrossRefGoogle Scholar