Evenvertex Oblong Mean Labeling of Union of Graphs

Abstract

The  oblong number is denoted by and is defined by . Suppose G = (V, E) be loop-free, not having multiple edges, finite, and non-directed graph with |V(G)| = p and |E(G)| = q. An evenvertex oblong mean labeling is an injective function    where  is the  oblong number that induces a bijective edge labeling  defined by  for all e = uv   E(G). Any graph that accommodates evenvertex oblong mean labeling is known as evenvertex oblong mean graph. In the present paper, evenvertex oblong mean labeling of union of some special graph with any evenvertex oblong mean graph is investigated.