Root Cube Mean Cordial Labeling of Some Standard Graphs
N. G. Gidheeba · Bioscience Biotechnology Research Communications · 2020
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 is called a root cube mean cordial labeling if | vf (i)vf (j)| ET1 and | ef (i)ef (j)|<1, where vf (x) and ef (x) 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, root cube mean cordiality of some standard graphs such as cycle, path, star are discussed .