G_0->G_1->G_2->G_3......... G_i be the graphs generated by successively performing the distance-2 operation on its parent (previous graph). There comes a stage after which 1. G_k+1= Complement (G_k) for k=i,i+1,..... and so on. (i is some number >0 which varies from graph to graph). 2. Or the graph just disconnects itself. Why