Skip to main content Accessibility help
×
Home

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

  • CAI HENG LI (a1) and CHERYL E. PRAEGER (a1)

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.

Copyright

Footnotes

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

Footnotes

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

  • CAI HENG LI (a1) and CHERYL E. PRAEGER (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed