Root cube mean cordial labeling of K1,n × Pm

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) → {0, 1, 2} is called root cube mean cordial labeling if the induced function f* : E(G) → {0, 1, 2} defined by f*(uv)=⌊ (f(u))3+(f(v))32 ⌋ satisfies the condition |vf(i) − vf(j)| ≤ 1 and |ef(i) − ef(j)| ≤ 1 for any i,j ∈ {0,1,2} where vf(x) and ef(x) denotes the number of vertices and number of edges with label x respectively and ⌊x⌋ 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 discussed root cube mean cordial labeling of the graph K1,n × Pm. The original version of this article supplied to AIP Publishing contained errors in its equations. These errors have been corrected in the new article published on 14 March 2024.