Volume : IV, Issue : V, May - 2014

Further New Skolem Difference 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 from{1,2,...,q}. A graph that admits skolem difference mean labeling is called a skolem difference mean graph. In this paper, some new classes of graphs are defined and their skolem difference mean labeling is studied.

Keywords :

Article: Download PDF   DOI : 10.36106/ijar  

Cite This Article:

K.Murugan Further New Skolem Difference Mean Graphs Indian Journal of Applied Research, Volume.4, Issue.5, May-2014

Number of Downloads : 657

References :