Study of Mean Labelings on Product Graphs

Let G be a(p,q) graph and let: {O,1,…,q} be an injection. Then G is said to have a mean labeling if for each edge uv, there exists an induced injective map {1,2,…,q} defined by if is even if is odd The graph G is said to be a near mean graph if the injective map f : V(G) {1,2,…,q-1,q+1} induces {1,2,…,q} which is also injective, defined as above. In this paper , We looked at the direct product of paths and augmented star graphs for their mean labelings and the Cartesian product of Pn and K4 for its near- meanness in labelings.