1Department of Mathematics, Govindammal Aditanar College for Women, Tiruchendur, Tamilnadu, India
2Department of Mathematics, Kamaraj College of Engineering and Technology, Virudhunagar, Tamilnadu, India
American Journal of Applied Mathematics and Statistics.
2014,
Vol. 2 No. 5, 302-306
DOI: 10.12691/ajams-2-5-2
Copyright © 2014 Science and Education PublishingCite this paper: P. Jeyanthi, 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.
Correspondence to: P. Jeyanthi, Department of Mathematics, Govindammal Aditanar College for Women, Tiruchendur, Tamilnadu, India. Email:
jeyajeyanthi@rediffmail.comAbstract
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