Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Self-Complementary Vertex-Transitive Graphs Need Not be Cayley Graphs

Self-Complementary Vertex-Transitive Graphs Need Not be Cayley Graphs 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. 2000 Mathematics Subject Classification 05C25. © London Mathematical Society http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Bulletin of the London Mathematical Society Oxford University Press

Self-Complementary Vertex-Transitive Graphs Need Not be Cayley Graphs

Loading next page...
 
/lp/oxford-university-press/self-complementary-vertex-transitive-graphs-need-not-be-cayley-graphs-NAYaG4gWC0

References (13)

Publisher
Oxford University Press
Copyright
© London Mathematical Society
ISSN
0024-6093
eISSN
1469-2120
DOI
10.1112/S0024609301008505
Publisher site
See Article on Publisher Site

Abstract

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. 2000 Mathematics Subject Classification 05C25. © London Mathematical Society

Journal

Bulletin of the London Mathematical SocietyOxford University Press

Published: Nov 1, 2001

There are no references for this article.