A family of switch equivalent graphs

Let 2G be the graph consisting of two disjoint copies of G. We prove that every graph of the form 2H can be transformed to every other graph of the form 2K using the following operations:(i)adding edge uv if d(u)=d(v) and uv is not present, (ii)deleting edge uv if d(u)=d(v) and uv is present.