ROOT CUBE MEAN CORDIAL LABELING OF Cn V Cm, FOR n, m ∈ ℕ

ROOT CUBE MEAN CORDIAL LABELING OF Cn V Cm, FOR n, m ∈ ℕ

S. Mundadiya, J. Parejiya, M. Jariya

[PDF]

Abstract

All the graphs considered in this article are simple and undirected. Let G = (V(G), E(G)) be a simple undirected Graph. A function f : V (G) ! f0; 1; 2g is called root cube mean cordial labeling if the induced function f  : E(G) ! f0; 1; 2g de ned by f (uv) = b q ((f(u))3+(f(v))3 2 c satis es the condition jvf (i) - vf (j)j   1 and jef (i) - ef (j)j   1 for any i; j 2 f0; 1; 2g, where vf (x) and ef (x) denotes the number of vertices and number of edges with label x respectively and bxc denotes the greatest integer less than or equals to x. A Graph G is called root cube mean cordial if it admits root cube mean cordial labeling. In this article we have shown that the join of two cycles Cn _ Cm is not a root cube mean cordial and also we have provided graph which is root cube mean cordial.

Keywords

Cycle, root cube mean cordial labeling, Join of two graphs G _ H, labeling, corona of graphs.