One Modulo Three Mean Labeling Of Graphs

The concept of one modulo three mean labeling graph is, if there is an injective function φ from the vertex set of G to the set { a /0 ≤ a ≤ 3 q − 2 and either a ≡ 0( mod 3) or a ≡ 1 ( mod 3)} where q is the number of edges of G and φ induces a bijection φ * from the edge set of G to { a /1≤ a ≤ 3 q − 2, a ≡ 1 ( mod 3) } given by φ * ( u υ ) = [ φ ( u ) + φ ( υ ) 2 ] and the function φ is called one modulo three mean labeling of G. In this paper, we obtain the results of one modulo three mean labeling of some several graphs.