I_n- Mean Cordial Graphs

Abstract

A graph labeling is an assignment of  integers to the  vertices or edges or both depending on certain conditions. A graph G with p vertices and q edges is said to admit - mean cordial labeling if the vertex labeling  from to , where    induces the function   from    to  as with the condition that   and   for all  A graph with   - mean cordial labeling is called an  - mean cordial graph. In this paper, we prove that path graphs, cycle graphs, complete graphs, wheel graphs and friendship graphs are  - mean cordial graphs. Further, we prove that path graphs, cycle graphs are  - mean cordial graphs.