@article{ajams2014252,
author={{Jeyanthi, P. and Maheswari, A.},
title={One Modulo Three Mean Labeling of Graphs},
journal={American Journal of Applied Mathematics and Statistics},
volume={2},
number={5},
pages={302--306},
year={2014},
url={http://pubs.sciepub.com/ajams/2/5/2},
issn={2333-4576},
abstract={In this paper, we introduce a new labeling called one modulo three mean labeling. A graph <i>G</i> is said to be one modulo three mean graph if there is an injective function <img src=image/abs1.png></img> from the vertex set of <i>G </i>to the set {<i>a </i>| <i>0 ¡Ü a ¡Ü 3q-2</i> and either <i>a¡Ô0</i>(<i>mod 3</i>) or <i>a¡Ô1</i>(<i>mod 3</i>) } where <i>q</i> is the number of edges of <i>G</i> and <img src=image/abs2.png></img> induces a bijection <img src=image/abs3.png></img> from the edge set of G to <img src=image/abs4.png></img>given by <img src=image/abs5.png></img> and the function <img src=image/abs6.png></img> is called one modulo three mean labeling of <i>G</i>. Furthermore, we prove that some standard graphs are one modulo three mean graphs.},
doi={10.12691/ajams-2-5-2}
publisher={Science and Education Publishing}
}