The reverse degree distance of a connected graph G is de ned as rD'(G) = 2(∣V (G)∣-1) ∣E(G)∣ d(G)-1 2 Σ u,v∈V (G) (dG(u)+dG(v))dG(u; v); where d(G) is the diameter of G: In this paper, we present the exact formulae for the reverse de- gree distance of some graph operations, such as tensor product, strong product and join of two connected graphs.