The complementary graph G' of a simple graph G has the same vertices as G. Two vertices are adjacent in G' if and only if they are not adjacent in G. Define Qn' (Hypercube complement).
Answer given :-The graph whose vertices are bit strings of length n and two vertices are adjacent if the bit string represented by them differe by more than one bit.
I want to understand that whether the complement graph will have self loops?Because the answer given doesn't consider self loops.I mean why are we not considering the bit strings that are differing by 0 bit,as these are also not there in original graph ,so it must be in complementary graph?