### Group mean cordial labeling of some path and cycle related graphs

#### Abstract

Let G be a (p,q) graph and let A be a group. Let f: V(G)->A be a map. For each edge uv assign the label [o(f(u))+o(f(v))/2]. Here o(f(u)) denotes the order of f(u) as an element of the group A. Let I be the set of all integers that are labels of the edges of G. f is called a group mean cordial labeling if the following conditions hold:

(1) For x,y∈A, |v_{f}(x)−v_{f}(y)|≤1, where v_{f}(x) is the number of vertices labeled with x.

(2) For i,j∈I, |e_{f}(i)−e_{f}(j)|≤1, where e_{f}(i) denote the number of edges labeled with i.

**Published:**2022-07-04

**How to Cite this Article:**R.N. Rajalekshmi, R. Kala, Group mean cordial labeling of some path and cycle related graphs, J. Math. Comput. Sci., 12 (2022), Article ID 183 Copyright © 2022 R.N. Rajalekshmi, R. Kala. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Copyright ©2022 JMCS