Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Does every self-complementary graph has a non-trivial automorphism group?

share|cite|improve this question
One-vertex graph is self-complementary and its automorphism group is trivial. – dtldarek Aug 25 '13 at 13:49
See also this… – Jernej Aug 25 '13 at 19:18

Every self-complementary graph on more than one vertex has non-trivial automorphisms. See for example page 16 in

Edit: I should add that this result is not too hard to prove, so I give an outline. Suppose $A$ and $B$ are the adjacency matrices of $G$ and its complement. Since $G$ is self-complementary, there is a permutation matrix $P$ such that $P^TAP=B$. Now if $J$ is the all-ones matrix then $B=J-I-A$ and $P^TJP=J$, so we find that $(P^2)^TAP^2=A$. This implies that $P^2$ represents an automorphism of $G$. The trick is to show that $P^2\ne I$, and to show this you need to show that $P$ does not have a cycle of length two.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.