• EVEN VERTEX ODD MEAN LABELING OF H-GRAPH

Abstract

A graph with p vertices and q edges is said to have an even vertex odd mean labeling if there exists an injective function f:V(G)®{0, 2, 4, ... 2q-2,2q} such that the induced map f*: E(G)® {1, 3, 5, ... 2q-1} defined by               f*(uv)=  is a bijection. A graph that admits an even vertex odd mean labeling is called an even vertex odd mean graph. Here we study   the even vertex odd mean behaviour of H-graph.