![GATE 2015 [Set-2]](https://solutionsadda.in/wp-content/uploads/2019/05/green-new-logo.png){kind=logo}
GATE 2014 [Set-1]
April 3, 2025GATE 2015 [Set-3]
April 3, 2025GATE 2015 [Set-2]
|
Question 60
|
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
|
Question 60 Explanation:
An n vertex self-complementary graph has exactly half number of edges of the complete graph i.e., n(n-1)/4 edges. Since n(n – 1) must be divisible by 4, n must be congruent to 0 or 1 module 4.
Correct Answer: D
Question 60 Explanation:
An n vertex self-complementary graph has exactly half number of edges of the complete graph i.e., n(n-1)/4 edges. Since n(n – 1) must be divisible by 4, n must be congruent to 0 or 1 module 4.