Hostname: page-component-586b7cd67f-l7hp2 Total loading time: 0 Render date: 2024-11-25T02:55:26.289Z Has data issue: false hasContentIssue false
  • English
  • Français

Vertex-transitive graphs which are not Cayley graphs, I

Part of: Graph theory Permutation groups

Published online by Cambridge University Press:  09 April 2009

Brendan D. McKay  and
Cheryl E. Praeger
Brendan D. McKay
Affiliation:
Computer Science Department, Australian National University, ACT 0200, Australia, [email protected]
Cheryl E. Praeger
Affiliation:
Department of Mathematics, University of Western Australia, Nedlands, WA 6009, Australia, [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.

The Petersen graph on 10 vertices is the smallest example of a vertex-transitive graph which is not a Cayley graph. We consider the problem of determining the orders of such graphs. In this, the first of a series of papers, we present a sequence of constructions which solve the problem for many orders. In particular, such graphs exist for all orders divisible by a fourth power, and all even orders which are divisible by a square.

MSC classification

Secondary: 05C25: Graphs and abstract algebra (groups, rings, fields, etc.) 20B25: Finite automorphism groups of algebraic, geometric, or combinatorial structures
Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 56 , Issue 1 , February 1994 , pp. 53 - 63
Copyright
Copyright © Australian Mathematical Society 1994

References

[1]Aispach, B. and Parsons, T. D., ‘A construction for vertex-transitive graphs’, Canad. J. Math. 34 (1982), 307–318.CrossRefGoogle Scholar
[2]Aispach, B. and Sutcliffe, R. J., ‘Vertex-transitive graphs of order 2p’, Ann. New York Acad. Sci. 319 (1979), 19–27.Google Scholar
[3]Behzad, M. and Chartrand, G., Introduction to the theory of graphs (Allyn and Bacon, Boston, 1971).Google Scholar
[4]Frucht, R., Graver, J. and Watkins, M., ‘The groups of the generalized Petersen graphs’, Math. Proc. Cambridge Philos. Soc. 70 (1971), 211–218.CrossRefGoogle Scholar
[5]Godsil, C. D., ‘More odd graph theory’, Discrete Math. 32 (1980), 205–217.CrossRefGoogle Scholar
[6]Liebeck, M. W. and Saxl, J., ‘Primitive permutation groups containing an element of large prime order’, J. London Math. Soc. 31 (1985), 237–249.CrossRefGoogle Scholar
[7]Lorimer, P., ‘Trivalent symmetric graphs of order at most 120’, European J. Combin. 5 (1984), 163–171.CrossRefGoogle Scholar
[8]Marušič, D., ‘Cayley properties of vertex symmetric graphs’, Ars Combin. 16B (1983), 297–302.Google Scholar
[9]Marušič, D., ‘Vertex-transitive graphs and di-graphs of order pk’, Ann. Discrete Math. 27 (1985), 115–128.Google Scholar
[10]Marušič, D. and Scapellato, R., ‘Characterising vertex-transitive pq-graphs with an imprimitive automorphism subgroup’, J. Graph Theory 16 (1992), 375–387.CrossRefGoogle Scholar
[11]Marušič, D., ‘Imprimitive representations of SL(2, 2k)’, J. Combinatorial Theory (Ser. B) 58 (1993), 46–57.CrossRefGoogle Scholar
[12]McKay, B. D., ‘Transitive graphs with fewer than twenty vertices’, Math. Comp. 33 (1979), 1101–1121 (and microfiche supplement).CrossRefGoogle Scholar
[13]McKay, B. D. and Royle, G. F., ‘The transitive graphs with at most 26 vertices’, Ars Combin. 30 (1990), 161–176.Google Scholar
[14]Praeger, C. E. and Xu, M. Y., ‘Vertex primitive graphs of order a product of two distinct primes’, J. Combinatorial Theory (Ser. B), to appear.Google Scholar
[15]Praeger, C. E., ‘A characterization of a class of symmetric graphs of twice prime valency’, European J. Combin. 10 (1989), 9–102.CrossRefGoogle Scholar
[16]Royle, G. F., Constructive enumeration of graphs (Ph.D. Thesis, University of Western Australia, 1987).Google Scholar
[17]Royle, G. F. and Praeger, C. E., ‘Constructing the vertex-transitive graphs of order 24’, J. Symbolic Comput. 8 (1989), 309–326.CrossRefGoogle Scholar
[18]Wielandt, H., Finite permutation groups (Academic Press, New York, 1964).Google Scholar