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
I got this question in an interview.
Enquiry is from Graphs Properties topic in chapter Graphs of Discrete Mathematics