Geometric Mean 4 Square E Cordial Labeling

Abstract

Let G(V,E) be Let G(V,E) be a simple graph and let  be a mapping with the induced labeling  defined by  (mod 2) where then f is called a geometric mean 4-square E cordial labeling if   and  where  and  is the number of vertices labeled with 0 and labeled by 1 and  and  is the number of edges labeled with i and labeled by j respectively. A graph which admits a geometric mean 4-square E cordial labeling is called a geometric mean 4-square E cordial graph. In this paper some general are shown are 4-square sum E cordial graph.a simple graph and let  be a mapping with the induced labeling  defined by  (mod 2) where then f is called a geometric mean 4-square E cordial labeling if   and  where  and  is the number of vertices labeled with 0 and labeled by 1 and  and  is the number of edges labeled with i and labeled by j respectively. A graph which admits a geometric mean 4-square E cordial labeling is called a geometric mean 4-square E cordial graph. In this paper some general are shown are 4-square sum E cordial graph.