A is a graph which has the same number of edges as its complement must have number of vertices congruent to 4m or 4m modulo 4(for integral values of number of edges).

• A. subgraph
• B. hamiltonian graph
• C. euler graph
• D. self complementary graph