Cordial labeling for the splitting graph of some standard graphs

Journal: International Journal of Mathematics and Soft Computing (Vol.1, No. 1)

Publication Date: 2011-08-18

Authors : P. Lawrence Rozario Raj S. Koilraj;

Page : 105-114

Keywords : Cordial labeling; Splitting graph;

Source : Download Find it from : Google Scholar

In this paper we prove that the splitting graph of path Pn, cycle Cn, complete bipartite graph Km,n, matching Mn, wheel Wn and are cordial.