A family of switch equivalent graphs Original Research Article

et image be the graph consisting of two disjoint copies of G. We prove that every graph of the form image can be transformed to every other graph of the form image using the following operations: (i) adding edge image if image and image is not present, (ii) deleting edge image if image and