k-Odd mean labeling of prism

A (p, q) graph g is said to have a k-odd mean labeling (k ≥ 1) if there exists an injection f : v → {0, 1, 2, . . . , 2k + 2q − 3} such that the induced map f ∗ defined on e by f ∗(uv) = ⌈ f (u)+f (v) ⌉ is a bijection from e to {2k − 1, 2k + 1, 2k + 3, . . . , 2k + 2q − 3}. a graph that admits k-odd mean labeling is called k-odd mean graph. in this paper, we investigate k-odd mean labeling of prism cm × pn.