All Self-Complementary Symmetric Graphs

In 1992, H. Zhang (J. Graph Theory 16, 1–5), using the classification of finite simple groups, gave an algebraic characterisation of self-complementary symmetric graphs. Yet, from this characterisation it does not follow whether such graphs, other than the well-known Paley graphs, exist. In this paper we give a full description of self-complementary symmetric graphs and their automorphism groups. In particular, we prove that apart from the Paley graphs there is another infinite family of self-complementary symmetric graphs and, in addition, one more graph not belonging to any of these families. We obtain this by investigating automorphism groups of graphs and applying classification results on primitive permutation groups of low rank. We prove also that the automorphism group of a self-complementary symmetric graph is permutation isomorphic to a subgroup of AΓL1(pr) with three exceptions, when it can be presented as a subgroup of AΓL2(pr).