[TOC]

Definition of Self-complementary graph

Def. A undirected graph is self-complementary if . An isomorphism is called a complementing isomorphism. Additionally, and .

Order of SC graph

Prop. If is self-complementary of order , then or . Moreover, if is regular, .

Proof. Compute number of edge and valency of .

Rmk. In fact, for each with congruent to or modulo , we can construct a self-complement graph of order .

Prop. (Muzuchuk) If is vertex-transitive self-complementary graph of order , then for each , where is the largest power of which divides .

Construct a SC Cayley graph

Prop. Conversely, if satisfies , then there exists self-complementary Cayley graphs of order .

Proof. Goal: For any with congruent to modulo , construct a Cayley graph.

Let , where are distinct primes. Let where .

Let such that and let . Then and is semi-regular on . Suppose divides into orbits . Let . Then spilts into and . Let . Then . Then . Since for any , is undirected.

Edge-trans & SC graph is Cayley with order prime power

Prop. (Zhang, Hong) Let be edge-transitive and self-complementary of order . Then

  • with odd prime, .
  • is vertex-transitive
  • .
  • .

Proof. Let where is a complementing isomorphism. Then is -homogenus on , i.e. is transitive on .

fact: If a -homogenus group is not -transitive, then is odd.

Since is even, is -transitive on . For any , take and consider such that . Note that and , so is transitive. Moreover, is not -transitive, otherwise is . By the classification of -transitive groups, we conclude that , where is an odd prime, due to the fact that has a normal subgroup of index which is not -transitve. In particular, and is Cayley.

fact: An affine 2-transitive group has a unique minimal normal subgroup, which is elementary abelian and acts regularly (known as an EARNS). From stackexchange.

It seems that Zhang Hong’s method is different from that in class: A result of Burnside [1] shows that a doubly transitive group has a unique minimal normal subgroup that is either elementary abelian or simple. Using the classification of finite simple groups and the results by Cameron [2], Curtis, Kantor, and Seitz [3], we shall show that in our case the simple nonabelian group cannot occur as the minimal normal subgroup. Hence must contain a transitive elementary abelian group and , can be considered as a subgroup the acting on the dimensional vector space over the finite field with elements, where is the zero vector of .

Then the vertex set can be identified with a vector space such that contains the additive group of and so is Cayley.

ref: Self-complementary symmetric graphs. Zhang, Hong

Now we construct a Cayley graph of order . Let which can be seen as . Note that has an automorphism of order . Then divides into two orbits and where . Then and is a complementing isomorphism. As , and so is undirected.

A question

Question. Let be a finite group. Assume that has an automorphism which is of order such that fixes no element of .

  • Construct a Cayley graph of which is self-complementary.
  • find such non-abelian group .

Here are some properties about fixed-point-free automorphism.

Prop. Let be a finite group. Assume that has an automorphism which is of order and fixes no element of . Then is of odd order and is abelian.

Proof. Since fixes no nontrivial element, and so is of odd order.

Define . If there exist with , then and , contradication. As is a finite group, is a bijection. So each element of can be written in the form of . Note that . Thus for all . Then for any . Therefore, is abelian.