A graph is self-complementary if it is isomorphic to its complement. For all…
GATE · 2015 · CS · Set 2 · Computer Science & IT
A graph is self-complementary if it is isomorphic to its complement. For all self-complementary graphs on 𝑛 vertices, 𝑛 is
- A.
A multiple of 4
- B.
Even
- C.
Odd
- D.
Congruent to
, or,.
Attempted by 222 students.
Sign up free to check your answer
Sign up freeLoading lesson…