| Abstrakt: |
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,. . ., p-1, p+1} such that the induced map f* defined by f* (uv) = { 1 if(f(u) + f(v)) = 0 (mod2) 0 else and it satisfies the condition |ef(0)- ef(1)|= 1, where ef(0) and ef(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 Tn and Snail graph Snare Near Mean Cordial graphs. [ABSTRACT FROM AUTHOR] |
