  Given a graph $G$, the graph associahedron $\mathcal{A}(G)$ is a polytope
whose 1-skeleton is the rotation graph of $G$, that is, the 1-skeleton of
$\mathcal{A}(G)$ is the graph $\mathcal{R}(G)$ whose vertices are the search
trees on $G$ and whose edges correspond to an application of a local operation
on the search trees, called rotation. The rotation distance between two search
trees on $G$ is the minimum number of rotations needed to transform one of the
trees into the other. A challenging question is what is the maximum rotation
distance between search trees on a graph, i.e. what is the combinatorial
diameter of the corresponding graph associahedron. In this paper we study the
relation between the structure of $\mathcal{R}(G)$ and $\mathcal{R}(G-S)$ for a
particular choice of $S\subseteq E(G)$. More specifically, we show that if $W$
is a set of true twins in $G$ and $S$ is the set of edges in $G$ with both
endpoints in $W$, then $\mathcal{R}(G-S)$ is a quotient graph of
$\mathcal{R}(G)$. We also give a lower bound for $\text{diam}
(\mathcal{R}(G-S))$ in terms of $\text{diam}(\mathcal{R}(G))$. As a
consequence, we obtain a new lower bound for the diameter of the graph
associahedra of balanced complete bipartite graphs that allow us to compute the
exact value of $\text{diam}(\mathcal{R}(K_{2,q}))$ for $q\in\{3,4,5,6,7,8\}$.
