In [1] a graph closely related to the 2-line graph (or 2-rotation graph) L2(G) was
dened. For a graph G of size m, the double-rotation graph R2(G) is dened as that
graph whose vertices are the
edge-induced subgraphs of size 2 in G, and where
vertices F and H are adjacent in R2(G) if and only if there exists a pairing of the two
edges of F with the two edges of H (one edge of F and one edge of H in each pair)
such that the two edges in each pair are adjacent.
then etX = et.