• MEANNESS OF SPECIAL CLASS OF GRAPHS

Abstract

Let G = (V, E) be a simple graph. G is said to be a mean graph if  f : V(G)→{0,1,2….q} such that for each edge uv, the induced map f* defined by  f*(uv) = is  injective where  denote the least integer which is greater than or equal to x and  f*(E(G)) = {1,2,3… q}

The graph that admits a mean labeling is called a mean graph.

In this paper, we proved that D₂ [K_1,n], C₂[P_n], T₂[C₃], Gl (n), D₂ (K_1,n), C₂(P_n), C₃*C_n, Ladder P_n×P₂ and  Z-(P_n) are mean graphs.