The concept of edge rotations and distance between graphs was introduced by Gary Chartrand et.al
[1].A graph G can be transformed into a graph H by an edge rotation if G contains distinct vertices u, v and w
such
uvE(G) and uwE(G) and H G uv uw
. In this case, G is transformed into H by” rotating”
the edge uv of G into uw. In this paper we consider rotations on generalized Petersen graphs and minimum selfcenteredgraphs. We have also developed algorithms to generate distance degree injective (DDI) graphs and
almost distance degree injective (ADDI) graphs from cycles using the concept of rotations followed by some
general results
