Question:

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

Show Hint

Self-complementary graphs have a specific condition for the number of vertices. This condition restricts \( n \) to values that satisfy \( n \equiv 0 \, (\text{mod } 4) \) or \( n \equiv 1 \, (\text{mod } 4) \).
Updated On: Jun 16, 2025
  • a multiple of 4
  • even
  • odd
  • congruent to 0 mod 4 or 1 mod 4
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is D

Solution and Explanation

For a graph to be self-complementary, the number of vertices \( n \) must be such that \( n \equiv 0 \, (\text{mod } 4) \) or \( n \equiv 1 \, (\text{mod } 4) \). This is a necessary condition for the graph and its complement to be isomorphic. 
Therefore, the correct answer is option (4). 
 

Was this answer helpful?
0
0