The reciprocal complementary Wiener number of a connected graph G is defined as where D is the diameter of G and dG(x, y) is the distance between vertices x and y. In this work, we study the reciprocal complementary Wiener number of various graph operations such as join, Cartesian product, composition, strong product, disjunction, symmetric difference, corona product, splice and link of graphs.