Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. 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

A self-complementary graph is isomorphic to its (edge) complement. My question is whether finding a maximum cardinality independent set remains hard on this class of graphs. It is known that for some sub-classes of self-complementary graphs the problem becomes in P but I couldn't find anything regarding the more general question.

Thanks!

share|cite|improve this question

Your Answer

 
discard

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

Browse other questions tagged or ask your own question.