The concept of edge rotations and distance between graphs was introduced by Gary Chartrand et al. A graph G can be transformed into a graph H by an edge rotation if G contains distinct vertices u,v and w such that uv ∈ E(G), uw / ∈ E(G) and H ∼ = G−uv +uw. In this paper we consider rotations on some snake related graphs followed by some general results.