SOME RESULTS ON NEAR MEAN CORDIAL GRAPH

Let G = (V,E) be a simple graph. A near mean cordial labeling on G is a function in f : V(G) {1,2,3,…,p1,p1} such that for each edge uv 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, some well known graphs namely ,Globe(Gl(n)),S’(Pn), Quadrilateral snake (), Comb () are proved as Near Mean Cordial Graphs.