Hostname: page-component-7f64f4797f-9t7q9 Total loading time: 0 Render date: 2025-11-03T12:18:27.103Z Has data issue: false hasContentIssue false
  • English
  • Français

SELF-COMPLEMENTARY VERTEX-TRANSITIVE GRAPHS NEED NOT BE CAYLEY GRAPHS

Published online by Cambridge University Press:  28 November 2001

CAI HENG LI  and
CHERYL E. PRAEGER
CAI HENG LI
Affiliation:
Department of Mathematics and Statistics, The University of Western Australia, 35 Stirling Hwy, Crawley, WA 6009, Australia; li@maths.uwa.edu.au, praeger@maths.uwa.edu.au
CHERYL E. PRAEGER
Affiliation:
Department of Mathematics and Statistics, The University of Western Australia, 35 Stirling Hwy, Crawley, WA 6009, Australia; li@maths.uwa.edu.au, praeger@maths.uwa.edu.au
Get access

Abstract

A construction is given of an infinite family of finite self-complementary, vertex-transitive graphs which are not Cayley graphs. To the authors' knowledge, these are the first known examples of such graphs. The nature of the construction was suggested by a general study of the structure of self-complementary, vertex-transitive graphs. It involves the product action of a wreath product of permutation groups.

Information

Type
NOTES AND PAPERS
Information
Bulletin of the London Mathematical Society , Volume 33 , Issue 6 , November 2001 , pp. 653 - 661
Copyright
© The London Mathematical Society 2001

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

Footnotes

This work forms a part of an Australian Research Council grant project.