MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

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

Given two graphs $G$ and $H$ is there a nice way to check whether the cartesian product $G\Box H$ is self complementary without directly computing its complement and searching for isomorphism? For example, how can one show that $K_3\Box K_3$ is self complementary?

share|cite|improve this question
This looks very much like a homework question. One could show $K_3\Box K_3$ was self complementary by a couple of drawings. – Chris Godsil Jan 21 '13 at 12:56
@Chris godsil: Yes, thats why I said without computing the complement, may be using some arguments on the degrees of verices and using the fact that it is a cartesian product; and this is not a homework. – Pritam Majumder Jan 22 '13 at 6:00

Your Answer


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

Browse other questions tagged or ask your own question.