New results on edge rotation distance graphs

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$ $in $ $E(G)$, $uw$ $notin$ $E(G)$ and $H$ $cong$ $G - uv + uw$. In this paper we consider rotations on some snake related graphs followed by some general results.