Volume : 3, Issue : 5, May - 2014

Embedding of Non Skolem Differenece Mean Graphs

K. Murugan

Abstract :

A graph G =(V,E) with p vertices and q edges is said to have skolem difference mean labeling if it is possible to label the vertices x ϵ V with distinct elements f (x) from {1,2,…,p+q} in such a way that the edge e =uv is labeled with |f(u)–f(v) |/2 if |f(u)–f(v) | is even and (|f(u)–f(v) |+1)/2 if |f(u)–f(v) | is odd and the resulting labels of the edges are distinct and are {1,2,…,q}. A graph that admits skolem difference mean labeling is called a skolem difference mean graph. The necessary condition for a graph to be skolem difference mean is that p ≥q. In this paper, the graphs for which p <q are considered. They are embedded in skolem difference mean graphs and their skolem difference mean labeling is studied.