(a) Let G = (V, E) be a loop-free undirected graph. Recall that G is called self-complementary...

Question:

(a) Let G = (V, E) be a loop-free undirected graph. Recall that G is called self-complementary if G and are isomorphic. If G is self-complementary (i) determine |E| if |V| = n; (ii) prove that G is connected.
(b) Let n ∈ Z+, where n = 4k (k e Z+) or n = 4k + 1 (k ∈ N). Prove that there exists a self-complementary graph G = (V, E), where |V| = n.