CYCLE RELATED GRAPHS - NEAR MEAN CORDIAL

Abstract

Let G = (V,E) be a simple graph.  A  Near  Mean Cordial Labeling of  G is a function  in  f : V(G)  {1, 2, 3, . . . , p1, p1} such that the induced map f* defined by 

f* (uv)  = 

and it satisfies the condition |(0)(1)| 1, where(0) and (1) represent the number of edges labeled with 0 and 1 respectively. A graph is called a Near Mean Cordial Graph if it admits a near mean cordial labeling. 

In this paper, It is to be proved that  , Tortoise graph T_n  and  Snail graph S_nare Near Mean Cordial graphs. 

AMS Mathematics subject classification 2010:05C78.