Balanced Cordial Labeling and its Application to Produce new Cordial Families

Abstract

In this paper we have introduced a balanced cordial labeling for a graph G, which is a cordial labeling $ f $ with condition $ e_{f}(0)= e_{f}(1), v_{f}(0)= v_{f}(1). $ We proved that $ P_{n} \times C_{4t}, C_{n} \times C_{4t}$ ($n$ is even) are balanced cordial graphs. We also proved that the corona graph $ G_{1} \odot G_{2} $ is cordial, when $ G_{1} $ a cordial graph and $ G_{2} $ is a balanced cordial graph.