On Changing Behavior Of Edges Of Some Special Classes Of Graphs II

Let g be a p,q graph and f:v(g) → → {1,2, , … ,p+q-1,p+q+2}be an injection.For each edge e=uv, the inducted edge labelling f* is defined as follows:

f*(e)={ |f(u)-f(v) |/2  if |f(u)-f(v) |  is even

             |f(u)-f(v) |/2  if |f(u)-f(v) | is odd

Then f is called Near skolem difference mean labelling if f*(e) are all distinct and are from {1,2,3,… .q}.A graph that admits a Near skolem difference mean labelling is called Near skolem difference mean graph.In this paper, a new parameter E ^-1   IS introduced and verified for some graph.