Basic properties
Let be a vertex-transitive and self-complementary graph. Let be a complementing isomorphism of satisfying . Take such that and .
Lemma 1. Using the notation above, we have:
- fixes a unique vertex of ;
- is a complementing isomorphism for any ;
- if is undirected, then fixes a unique vertex and is divisible by .
Proof. i) Suppose fixes , then is an edge (or non-edge) both in and , which is impossible. For any , suppose . Since , is also an self-complementary graph by lemma 2. Thus is conjugate to or modulo . Since is vertex-transitive, is odd. Thus there is a such that . If , then we have where . Contradiction.
ii) is obvious.
iii) By i), fixes a unique point, which is denoted as . Now assume fixes and . Then . Now is fixed by , which is impossible. Therefore, fixes a unique vertex. Moreover, since , is even. If , then the order of is . So define and . If , then interchanges and fixes , which is impossible. Thus divides .
Lemma 2. Let such that . Then is self-complementary graph and is a self-complementing isomorphism.
Thm. (Muzychuk) If , then where is a undirected vertex-transitive self-complementary graph.
Proof. Let be a Sylow -subgroup of . Then is a Sylow -subgroup and there is such that . Let . Then is a complementing isomorphism of by lemma 1. Thus fixes a unique vertex, denoted as . Furthermore, . thus define and . By lemma 2, is self-complementary. Since is transitive on , is vertex-transitive self-complementary and so . Finially, and yields .
Construction of SCVT Cayley graph
Let be a group and such that fixes no element of . Let the orbit of on be . Then splits each into .
Let where . Then where . Now is self-complementary and undirected, with complementing isomorphism .
Exm. Let be a Frobenius group. . Then Let be the field automorphism of and , where and .
Let . Then , . Thus .
Claim: is fixed-point free on .
An element of have the form . If , . If , .
So we can construct undirected self-complementary graph as above.
(research) Problem. Explicitly construct finite groups which have fixed-point free automorphism of order .
Construction of SCVT Coset graph
Thm. Let be a group and be core-free. Then there exists an undirected self-complementary graph with a complementing isomorphism in iff there exists of order -power s.t. fixes no .
Proof. Assume fixes no . Let . Then acts on by .
Let be the orbits of on . Then for each as is of order -power. And divides into and . Clearly, interchanges and .
Let and where . Then , and . Thus is self-complementing graph, where for some . As , is undirected.
Conversely, if is undirected self-complementary graph with a complementing isomorphism , then , and . If there is a satisfying , then has non-empty intersection with and , which is impossible.
Example 1.
For , there is which is self-complentary if there exists such that fixes no for any .
Since fixes no , we have fixes no . By the previous theorem, is undirected SC graph.
Example 2.
Let with odd prime and . We want to find a such that is self-complentary.
Thm. Let with odd, and let . Let where is a diagonal automorphism of and is a field automorphism of order . Then there exists a SC graph with being a complementing isomorphism of and is not undirected.
Proof. Show for all . You can compute matices to show it.

Exm. (BLOW UP) Given as above, let . Define , . Let such that and . Let and . Then .
Claim: does not fix for any . Suppose . Then as , for some and . Note that . Whether or yields . And it implies for all , which is contradictory to and .