Cordial Labeling of M-Splitting Graph of a Graph

Abstract

In this paper, we investigate a condition for a splitting graph of a graph, to be cordial. We have extended the concept of splitting graph to $m$-splitting graph of a graph and proved that the $m$-splitting graph of every cordial graph is cordial. We also prove that the splitting graph of $W_n$ is cordial for all $n\geqslant 3$, splitting graph of $K_n$ is cordial for $ n=t^2$ and $t^2\pm 2 $ and splitting graph of shadow graph of any graph is cordial.