Let G =(V,E)be a graph and f be a mapping from ????(????) →{ ????, ????, ???? }. For each edge uv of G assign the label⌊√ ????(????) ????+????(????) ???? ???? ⌋, ,f is called a root cube mean cordial labeling if |???????? (????)– ???????? (????)| ≤ ???? and |???????? (????)– ???????? (????)| ≤ ????, where ????????(????) and ????????(????) denote the number of vertices and edges labeled with ????, ????{????, ????, ????} respectively. A graph with a root cube mean cordial labeling is called root cube mean cordial graph. In this paper, we investigate about the existence of root cube mean cordiality of subdivision of some graphs such as path, cycle, star, bistar, H- graph, ????⨀????????Graph, ????????⨀ ????????, ????????⨀ ???????? Graphs.