One Modulo Three Mean Labeling of Graphs

P. Jeyanthi^1, and A. Maheswari²

¹Department of Mathematics, Govindammal Aditanar College for Women, Tiruchendur, Tamilnadu, India

²Department of Mathematics, Kamaraj College of Engineering and Technology, Virudhunagar, Tamilnadu, India

Cite this paper

P. Jeyanthi and A. Maheswari. One Modulo Three Mean Labeling of Graphs. American Journal of Applied Mathematics and Statistics. 2014; 2(5):302-306. doi: 10.12691/AJAMS-2-5-2

Abstract

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.

Keywords

one modulo three mean labeling, one modulo three mean graph

Copyright

This work is licensed under a Creative Commons Attribution 4.0 International License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

References

[1]	F.Harary, Graph theory, Addison Wesley, Massachusetts, (1972).
[2]	J. A. Gallian, A dynamic survey of graph labeling, The Electronic Journal of Combinatorics, DS6, 2013.
[3]	S. Somasundaram and R. Ponraj, Mean Labeling of graphs, National Academy Science Letters Vol: 26,(2003), 210-213.
[4]	S. Somasundaram and R. Ponraj, Some results on Mean graphs, Pure and Applied Mathematika Sciences, Vol: 58 (2003), 29-35.
[5]	V. Swaminathan and C. Sekar, Modulo three graceful graphs, Proceed. National Conference on Mathematical and Computational Models, PSG College of Technology, Coimbatore, 2001, 281-286.