A simple graph is self-complementary if it is isomorphic to its complement. Prove that
Chapter 6, Problem 68(choose chapter or problem)
A simple graph is self-complementary if it is isomorphic to its complement. Prove that in a self-complementary graph with n nodes (n > 1), n = 4k or n = 4k + 1 for some integer k. (Hint: Use the result of Exercise 25.)
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer