1why this is out-of-syllabus-now?

The Gateway to Computer Science Excellence

+18 votes

A graph is self-complementary if it is isomorphic to its complement. For all self-complementary graphs on $n$ vertices, $n$ is

- A multiple of 4
- Even
- Odd
- Congruent to 0 $mod$ 4, or, 1 $mod$ 4.

+49 votes

Best answer

52,345 questions

60,503 answers

201,881 comments

95,331 users