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

Show that the only regular, self-complementary, planar graph is the 5-cycle. Pay special attention to the 4-regular case.

share|cite|improve this question
up vote 1 down vote accepted

Here's something to get you started. Let G be such a graph, with n vertices. If G is k-regular, then its complement is n-1-k-regular, so to be self-complementary, we must have k = n-1-k, so k = (n-1)/2. Now try finding a reason why the graph is nonplanar if k > 2.

share|cite|improve this answer
    
Yeah that's the idea. But how for the 4-regular case? – everybodyelse Oct 24 '10 at 14:58

Your Answer

 
discard

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.