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