@article{Article_82,

title = {k-Product Cordial Labeling of Splitting Graph of Star Graphs},

journal = {Communications in Combinatorics, Cryptography & Computer Science},

volume = {2024},

issue = {1},

issn = { 2783-5456 },

year = {2023},

url = {http://cccs.sgh.ac.ir/Articles/2024/issue 1/1-10-kProductCordialLabeling.pdf},

author = {K. Jeya Daisya and R. Santrin Sabibhab and P. Jeyanthi and Maged Z. Youssef},

keywords = {cordial labeling, product cordial labeling, k-product cordial labeling, splitting graph, star graph.},

abstract = {Let f be a map from V(G) to {0, 1, ..., k − 1} where k is an integer, 1 ⩽ k ⩽ |V(G)|. For each edge uv assign the label f(u)f(v)(mod k). f is called a k-product cordial labeling if |vf(i) − vf(j)| ⩽ 1, and |ef(i) − ef(j)| ⩽ 1, i, j ∈ {0, 1, ..., k − 1}, where vf(x) and ef(x) denote the number of vertices and edges respectively labeled with x (x = 0, 1, ..., k − 1). A graph that admits k-product cordial labeling is called k-product cordial graph. We have already proved that several families of graphs admit k-product cordial labeling. In this paper, we show that the splitting graph of star graphs admit k-product cordial labeling.}

};