The transformation graph of a graph is the graph with vertex set , in which two vertices and are joined by an edge if one of the following conditions holds: (i) and they are adjacent in , (ii) and they are not adjacent in , (iii) one of and is in while the other is in , and they are not incident in . In this paper, for any graph , we determine the independence number and the connectivity of . Furthermore, we show that for a graph with no isolated vertices, is hamiltonian if and only if is not a star and .