eng Science and Education Publishing American Journal of Applied Mathematics and Statistics 2333-4576 2014-08-28 2 5 302 306 10.12691/ajams-2-5-2 AJAMS2014252 article P. Jeyanthi jeyajeyanthi@rediffmail.com 1 A. Maheswari 2 Department of Mathematics, Govindammal Aditanar College for Women, Tiruchendur, Tamilnadu, India Department of Mathematics, Kamaraj College of Engineering and Technology, Virudhunagar, Tamilnadu, India In this paper, we introduce a new labeling called one modulo three mean labeling. A graph G is said to be one modulo three mean graph if there is an injective function from the vertex set of G to the set{a | 0 ≤ a ≤ 3q-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 given by and the function is called one modulo three mean labeling of G. Furthermore, we prove that some standard graphs are one modulo three mean graphs. http://pubs.sciepub.com/ajams/2/5/2/ajams-2-5-2.pdf one modulo three mean labeling one modulo three mean graph