# Mean 4- Square Sum E- Cordial Labeling of Some Simple Graphs

## Main Article Content

## Abstract

In this paper , we explicates a new definition of Mean 4 – square sum E- cordial graph which is defined as follows: ** **Let be a simple graph and let be a mapping with the induced labeling for each vertex u assign the label 1 if is odd assign the label 0 if is even. The mapping is called a mean 4- square sum E - cordial labeling if where and is the number of vertices labeled with 0 and labeled by 1 respectively. A graph which admits mean 4- square sum E - cordial labeling is called mean 4- square sum E - cordial graph.

## Article Details

Issue

Section

Articles