-
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, 1 mod 4
- A multiple of 4
Correct Option: D
An n vertex self complementary graph has exactly half number of edges of the complete graph
| i.e., | edges. | |
| 4 |
Since n (n –1) must be divisible by 4, n must be congruent to 0 or 1 module 4.
