Root Cube Mean Cordial Labeling of Some Special Graphs

Abstract

Let G =(V,E)be a graph and f be a mapping from V(G) { 0,1,2 }. For each edge uv of  G assign the label⌊√((〖f(u)〗^3+〖f(v)〗^3)/2)⌋, ,f is called a root cube mean cordial labeling if |v_f (i)–v_f (j)|≤ 1 and |e_f (i)–e_f (j)|≤1, where v_f (x) and e_f (x) denote the number of vertices and edges  labeled with x,x{0,1,2} 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 some special graph such as Coconut tree graph.