{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,2]],"date-time":"2023-12-02T00:34:43Z","timestamp":1701477283596},"reference-count":13,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2024,1]]},"abstract":"In 2012, Ponraj et al. defined k-product cordial labeling as follows: Let [Formula: see text] be a map from [Formula: see text] to [Formula: see text] where [Formula: see text] is an integer, [Formula: see text]. For each edge [Formula: see text] assign the label [Formula: see text] [Formula: see text]. [Formula: see text] is called a k-product cordial labeling if [Formula: see text], and [Formula: see text], [Formula: see text], where [Formula: see text] and [Formula: see text] denote the number of vertices and edges, respectively, labeled with [Formula: see text] [Formula: see text]. A graph that admits k-product cordial labeling is called k-product cordial graph. Later, we proved that several families of graphs are k-product cordial graphs. In this paper, we show that the product of graphs admit k-product cordial labeling.<\/jats:p>","DOI":"10.1142\/s1793830922501877","type":"journal-article","created":{"date-parts":[[2022,11,18]],"date-time":"2022-11-18T03:10:29Z","timestamp":1668741029000},"source":"Crossref","is-referenced-by-count":0,"title":["k-Product cordial labeling of product of graphs"],"prefix":"10.1142","volume":"16","author":[{"given":"K.","family":"Jeya Daisy","sequence":"first","affiliation":[{"name":"Department of Mathematics, Holy Cross College, Nagercoil, Tamilnadu, India"}]},{"given":"R.","family":"Santrin Sabibha","sequence":"additional","affiliation":[{"name":"Manonmaniam Sundaranar University, Tirunelveli, Tamilnadu, India"}]},{"ORCID":"http:\/\/orcid.org\/0000-0003-4349-164X","authenticated-orcid":false,"given":"P.","family":"Jeyanthi","sequence":"additional","affiliation":[{"name":"Research Centre, Department of Mathematics, Govindammal Aditanar College for Women, Tiruchendur 628215, Tamilnadu, India"}]},{"given":"Maged Z.","family":"Youssef","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Statistics, College of Science, Imam Mohammad Ibn Saud Islamic University, Riyadh 11623, Saudi Arabia"},{"name":"Department of Mathematics, Faculty of Science, Ain Shams University, Abbassia, Cairo, Egypt"}]}],"member":"219","published-online":{"date-parts":[[2022,12,28]]},"reference":[{"key":"S1793830922501877BIB001","first-page":"201","volume":"23","author":"Cahit I.","year":"1987","journal-title":"Ars Combin."},{"key":"S1793830922501877BIB002","first-page":"1","volume":"6","author":"Gallian J. A.","year":"2021","journal-title":"Electron. J. Combin."},{"key":"S1793830922501877BIB003","series-title":"Discrete Mathematics and its Applications","doi-asserted-by":"crossref","DOI":"10.1201\/b10959","volume-title":"Handbook of Product Graphs","author":"Hammack R.","year":"2011","edition":"2"},{"key":"S1793830922501877BIB004","volume-title":"Graph Theory","author":"Harary F.","year":"1972"},{"issue":"1","key":"S1793830922501877BIB005","doi-asserted-by":"crossref","first-page":"1","DOI":"10.22342\/jims.28.1.1025.1-7","volume":"28","author":"Jeya Daisy K.","year":"2022","journal-title":"J. Indones. Math. Soc."},{"key":"S1793830922501877BIB006","first-page":"72","volume":"2","author":"Jeya Daisy K.","year":"2022","journal-title":"Internat. J. Math. Combin."},{"issue":"2","key":"S1793830922501877BIB007","doi-asserted-by":"crossref","first-page":"59","DOI":"10.3126\/njmathsci.v3i2.49201","volume":"3","author":"Jeya Daisy K.","year":"2022","journal-title":"Nepal J. Math. Sci."},{"issue":"2","key":"S1793830922501877BIB008","volume":"13","author":"Jeya Daisy K.","year":"2023","journal-title":"TWMS J. Appl. Eng. Math."},{"issue":"4","key":"S1793830922501877BIB009","volume":"15","author":"Jeya Daisy K.","year":"2022","journal-title":"Jordan J. Math. Stat."},{"issue":"1","key":"S1793830922501877BIB010","volume":"13","author":"Jeya Daisy K.","year":"2023","journal-title":"TWMS J. Appl. Eng. Math."},{"issue":"15","key":"S1793830922501877BIB012","first-page":"733","volume":"7","author":"Ponraj R.","year":"2012","journal-title":"Int. J. Contemp. Math. Sci."},{"key":"S1793830922501877BIB013","first-page":"349","volume-title":"Theory of Graphs (Int. Symp., ICC Rome, 1966)","author":"Rosa A.","year":"1967"},{"issue":"1","key":"S1793830922501877BIB014","first-page":"155","volume":"23","author":"Sundaram M.","year":"2004","journal-title":"Bull. Pure Appl. Sci."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830922501877","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T10:13:38Z","timestamp":1701425618000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830922501877"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,28]]},"references-count":13,"journal-issue":{"issue":"01","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["10.1142\/S1793830922501877"],"URL":"http:\/\/dx.doi.org\/10.1142\/s1793830922501877","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":["Discrete Mathematics and Combinatorics"],"published":{"date-parts":[[2022,12,28]]}}}