Analytic odd mean labeling of union and identification of some graphs

Abstract

A graph G is analytic odd mean if there exist an injective function f : V → {0, 1, 3, . . . , 2q − 1} with an induced edge labeling f∗ : E → Z such that for each edge uv with f(u) < f(v), is injective. Clearly the values of f∗ are odd. We say that f is an analytic odd mean labeling of G. In this paper, we show that the union and identification of some graphs admit analytic odd mean labeling by using the operation of joining of two graphs by an edge.