SOLVED: The complement graph G of a simple graph G is defined asfollows: V (G) = V (G), and two vertices are adjacent in G if andonly if they are not adjacent in G. (Note that G is also a simplegraph by its definition). Solve the following: (i) Let d1, d2, . .. , dn be the degree sequence of a simple graph G, then what is thedegree sequence of G? (ii) If G is a simple graph with 15 edges andG has 13 edges, how many vertices does G have? (iii) A simple graphG is called self-complementary if G and

Refer to the complement of a graph. If G is a simple graph, the... | Filo