A graph G=(V,E) with p vertices and q edges is said to be a Root Cube Mean graph if it is possible to label the vertices xϵV with distinct lables f(x) from 1,2,…,q+1 in such a way that when each edge e=uv is labeled with f(e=uv)=⌈√((f(u)^3+f(v)^3)/2) ⌉ or ⌊√((f(u)^3+f(v)^3)/2) ⌋, then the resulting edge labels are distinct. Here f is called a root cube mean labeling of G. In this paper we prove that union related graphs such as Path union of two cycles, Path union of three cycles, k-Path union of two cycles C_m with path P_k, Path union of two crowns, Path union of three crowns,k-Path union of two crowns C_m^* with path P_k all are root cube mean graphs.

Graph, Root cube mean labeling, Path, Cycle, Crown.