In 2012, Ponraj et al. defined a concept of k-product cordial labeling as follows: Let f be a map from
to
where k is an integer,
. For each edge
assign the label
. f is called a k-product cordial labeling if
, and
,
, where
and
References
[1]
Harary, F. (1972) Graph Theory. Addison-Wesley.
[2]
Rosa, A. (1967) On Certain Valuations of the Vertices of a Graph. Theory of Graphs (International Symposium, Rome, July 1966), Dunod Gordon & Breach Science Publishers, Inc., New York and Dunod Paris, 349-355.
[3]
Gallian, J.A. (2021) A Dynamic Survey of Graph Labeling. The Electronic Journal of Combinatorics, 1-644.
[4]
Cahit, I. (1987) Cordial Graphs: A Weaker Version of Graceful and Harmonious Graphs. Ars Combinatoria, 23, 201-207.
[5]
Sundaram, M., Ponraj, R. and Somasundaram, S. (2004) Product Cordial Labeling of Graphs. Bulletin of Pure and Applied Sciences, 23, 155-163.
[6]
Rokad, A.H. (2019) Product Cordial Labeling of Double Wheel and Double Fan Related Graphs. Kragujevac Journal of Mathematics, 43, 7-13.
[7]
Seoud, M.A. and Helmi, E.F. (2011) On Product Cordial Graphs. Ars Combinatoria, 101, 519-529.
[8]
Vaidya, S.K. and Barasara, C.M. (2011) Product Cordial Labeling for Some New Graphs. Journal of Mathematics Research, 3, 206-211. https://doi.org/10.5539/jmr.v3n2p206
[9]
Vaidya, S.K. and Barasara, C.M. (2016) Product Cordial Labeling of Line Graph of Some Graphs. Kragujevac Journal of Mathematics, 40, 290-297.
[10]
Vaidya, S.K. and Kanani, K.K. (2010) Some Cycle Related Product Cordial Graphs. International Journal of Algorithms, Computing and Mathematics, 3, 109-116.
[11]
Vaidya, S.K. and Kanani, K.K. (2011) Some New Product Cordial Graphs. Mathematics Today, 27, 64-70.
[12]
Ponraj, R., Sivakumar, M. and Sundaram, M. (2012) k-Product Cordial Labeling of Graphs. International Journal of Contemporary Mathematical Sciences, 7, 733-742.
[13]
Ponraj, R., Sivakumar, M. and Sundaram, M. (2012) On 4-Product Cordial Graphs. International Journal of Mathematical Archive, 7, 2809-2814.
[14]
Jeya Daisy, K., Santrin Sabibha, R., Jeyanthi, P. and Youssef, M.Z. (2022) k-Product Cordial Behaviour of Union of Graphs. Journal of the Indonesian Mathematical Society, 28, 1-7. https://doi.org/10.22342/jims.28.1.1025.1-7
[15]
Jeya Daisy, K., Santrin Sabibha, R., Jeyanthi, P. and Youssef, M.Z. (2022) k-Product Cordial Labeling of Cone Graphs. International Journal of Mathematical Combinatorics, 2, 72-80.
[16]
Jeya Daisy, K., Santrin Sabibha, R., Jeyanthi, P. and Youssef, M.Z. (2022) k-Product Cordial Labeling of Napier Bridge Graphs. Nepal Journal of Mathematical Sciences, 3, 59-70. https://doi.org/10.3126/njmathsci.v3i2.49201
[17]
Jeya Daisy, K., Santrin Sabibha, R., Jeyanthi, P. and Youssef, M.Z. (2024) k-Product Cordial Labeling of Product of Graphs. Discrete Mathematics, Algorithms and Applications, 16, Article ID: 2250187. https://doi.org/10.1142/S1793830922501877
[18]
Jeya Daisy, K., Santrin Sabibha, R., Jeyanthi, P. and Youssef, M.Z. (2022) k-Product Cordial Labeling of Powers of Paths. Jordan Journal of Mathematics and Statistics, 15, 911-924.
[19]
Jeya Daisy, K., Santrin Sabibha, R., Jeyanthi, P. and Youssef, M.Z. (2023) k-Product Cordial Labeling of Fan Graphs. Turkic World Mathematical Society Journal of Applied and Engineering Mathematics, 13, 11-20.
[20]
Jeya Daisy, K., Santrin Sabibha, R., Jeyanthi, P. and Youssef, M.Z. (2024) k-Product Cordial Labeling of Splitting Graph of Star Graphs. Communications in Combinatorics, Cryptography & Computer Science, 1, 68-80.
[21]
Jeya Daisy, K., Santrin Sabibha, R., Jeyanthi, P. and Youssef, M.Z. (2024) Further Results on k-Product Cordial Labeling. Turkic World Mathematical Society Journal of Applied and Engineering Mathematics, 14, 981-990.
[22]
Jeyanthi, P. and Maheswari, A. (2012) 3-Product Cordial Labeling. SUT Journal of Mathematics, 48, 231-240.
[23]
Grimaldi, R.P. (1994) Discrete and Combinatorial Mathematics: An Applied Introduction. 3rd Edition, Addison-Wesley.