On one modulo three mean labeling of graphs

Abstract

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 {a | 1≤a≤3q – 2 and either a≡1 (mod3)} given by and the function ϕ is called one modulo three mean labeling of G. In this paper, we show that the graphs and C_m *e C_n are one modulo three mean graphs.

Keywords:

• One modulo three mean labeling
• one modulo three mean graphs

AMS Classification (2010)::

• 05C78