Integer Cordial Labeling in context of Ring sum of Graphs

Abstract

An Integer Cordial Labeling of a graph G*(p, q) is an one-one map g: V  * or  as p is even or odd, which induces an edge labeling  defined by such that the number of edges labeled 1 and the number of edges labeled 0 differ by at most 1. If a graph has integer cordial labeling (I.C.L.), then it is called integer cordial graph (I.C.G.). In this paper, I have investigated six new results in context of ring sum of graphs which admits integer cordial labeling.