Cordial labeling of $m$-splitting graph of a graph
Journal: International Journal of Mathematics and Soft Computing (Vol.7, No. 1)Publication Date: 2017.01.30
Authors : S. J. Gajjar; A. K. Desai;
Page : 33-42
Keywords : Graph labeling; cordial labeling; product cordial labeling;
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 $ngeqslant 3$, splitting graph of $K_n$ is cordial for $ n=t^2$ and $t^2pm 2 $ and splitting graph of shadow graph of any graph is cordial.
Other Latest Articles
Last modified: 2017-08-30 17:58:46