PATH RELATED MEAN CORDIAL GRAPHS
A. Nellai Murugan · 2014
Let G = (V, E) be a simple graph. G is said to be a mean cordial graph if f : V(G)→{0,1,2} such that for each edge uv the induced map f* defined by f*(uv) = where denote the least integer which is ≤ x and |e f (0) - e f (1)| ≤ 1 where e f (0) is no.of edges with zero label. e f (1) is no.of edges with one label. The graph that admits a mean cordial labeling is called a mean cordial graph(MCG).In this paper , we proved that P n ʘK 1 , (P n +K 1 ) , P n × P n ,(P n :C 3 ) ,(P n : S 1 ) , P n ×P 2 ,P n +2K 1 Z-(P n ) are mean cordial graphs. Keywords : Mean cordial labeling, Mean cordial graph. 2000 Mathematics Subject Classification 05C78.