{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:32:29Z","timestamp":1777703549504,"version":"3.51.4"},"reference-count":26,"publisher":"SAGE Publications","issue":"2","license":[{"start":{"date-parts":[[2019,7,2]],"date-time":"2019-07-02T00:00:00Z","timestamp":1562025600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"published-print":{"date-parts":[[2019,9,9]]},"abstract":"<jats:p>\n                    \u00a0Apart from other labeling signed product and total signed product labeling already have been applied on different kind of graphs. Signed product cordial labeling for the graph\n                    <jats:italic>G<\/jats:italic>\n                    \u00a0=\u00a0(\n                    <jats:italic>V<\/jats:italic>\n                    ,\n                    <jats:italic>E<\/jats:italic>\n                    ), where each vertex is labelled by 1 or -1 and edge label is induced by multiplication of two of it end vertices with the following restriction that the absolute difference between total number of vertices labelled by 1 and -1 is at most 1, similarly for the edges also. Total signed product cordial labeling follows property that absolute difference between total number of vertices and edges labelled by -1 and total number of vertices and edges labelled by 1 is at most 1. In this paper, we have considered Cartesian product between two balanced bipartite graphs and apply above labeling on it. We have designed some suitable algorithms which will driven by any kind of computer programming language. Illustration with example and complexity of the algorithms are analysed successfully.\n                  <\/jats:p>","DOI":"10.3233\/jifs-182746","type":"journal-article","created":{"date-parts":[[2019,7,5]],"date-time":"2019-07-05T10:54:09Z","timestamp":1562324049000},"page":"2435-2442","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":2,"title":["Algorithmic implementation of signed product and total signed product cordial labeling on complex graph"],"prefix":"10.1177","volume":"37","author":[{"given":"Sumonta","family":"Ghosh","sequence":"first","affiliation":[{"name":"Department of Mathematics, National Institute of Technology Durgapur, Durgapur, West Bengal, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hossein","family":"Rashmanlou","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University College of Rouzbahan, Sari, Iran"},{"name":"Mazandaran Adib Institute of Higher Education, Sari, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Mofidnakhaei","sequence":"additional","affiliation":[{"name":"Department of Physics, Sari Branch, Islamic Azad University, Sari, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anita","family":"Pal","sequence":"additional","affiliation":[{"name":"Department of Mathematics, National Institute of Technology Durgapur, Durgapur, West Bengal, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2019,7,2]]},"reference":[{"issue":"6","key":"e_1_3_2_2_2","article-title":"A dynamic survey of graph labeling","volume":"6","author":"Gallian J.A.","year":"2010","unstructured":"GallianJ.A., A dynamic survey of graph labeling, The Electronics Journal of Combinatorics 6 6(2010).","journal-title":"The Electronics Journal of Combinatorics"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1137\/0405048"},{"key":"e_1_3_2_4_2","unstructured":"HegdeS.M. On Multiplicative Labelings of a Graph. Labeling of Discrete Structures and applications. Narosa Publishing House (2008)83\u201396 New Delhi."},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1133"},{"key":"e_1_3_2_6_2","first-page":"201","article-title":"Cordial graphs a weaker version of graceful and harmonious graphs","volume":"23","author":"Cahit I.","year":"1987","unstructured":"CahitI., Cordial graphs a weaker version of graceful and harmonious graphs, Ars Combin 23 (1987)201\u2013207.","journal-title":"Ars Combin"},{"key":"e_1_3_2_7_2","first-page":"189","article-title":"On cordial and 3-equitable labellings of graphs","volume":"37","author":"Cahit I.","year":"1990","unstructured":"CahitI., On cordial and 3-equitable labellings of graphs, Util Math 37 (1990)189\u2013198.","journal-title":"Util Math"},{"key":"e_1_3_2_8_2","doi-asserted-by":"crossref","unstructured":"CahitI. Status of graceful tree conjecture in 1989 in Topics in Combinatorics and Graph Theory. BodendiekR. and HennR. (eds) Physica-Verlag Heidelberg 1990.","DOI":"10.1007\/978-3-642-46908-4_20"},{"key":"e_1_3_2_9_2","unstructured":"CahitI. Recent results and open problems on cordial graphs. Contemporary Methods in Graph Theory BodendiekR. (ed.). Wissenschaftsverlag Mannheim (1990) pp. 209\u2013230."},{"key":"e_1_3_2_10_2","first-page":"279","article-title":"Equitable tree labellings","volume":"40","author":"Cahit I.","year":"1995","unstructured":"CahitI., Equitable tree labellings, Ars Combin 40 (1995)279\u2013286.","journal-title":"Ars Combin"},{"key":"e_1_3_2_11_2","first-page":"311","article-title":"On harmonious tree labellings","volume":"41","author":"Cahit I.","year":"1995","unstructured":"CahitI., On harmonious tree labellings, Ars Combin 41 (1995)311\u2013317.","journal-title":"Ars Combin"},{"key":"e_1_3_2_12_2","first-page":"87","article-title":"H-cordial graphs","volume":"18","author":"Cahit I.","year":"1996","unstructured":"CahitI., H-cordial graphs, Bull Inst Combin Appl 18 (1996)87\u2013101.","journal-title":"Bull Inst Combin Appl"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1173"},{"key":"e_1_3_2_14_2","unstructured":"CahitI. Graceful labelings of rooted complete trees Personal communication."},{"key":"e_1_3_2_15_2","unstructured":"CahitI. A note on graceful directed trees personal communication."},{"key":"e_1_3_2_16_2","first-page":"119","article-title":"E3-cordial graphs","volume":"54","author":"Cahit I.","year":"2000","unstructured":"CahitI. and YilmazR., E3-cordial graphs, Ars Combin 54 (2000)119\u2013127.","journal-title":"Ars Combin"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1137\/0601045"},{"key":"e_1_3_2_18_2","unstructured":"RosaA. On certain valuations of the vertices of a graph Theory of graphs International Symposium 1967 349\u2013355."},{"issue":"6","key":"e_1_3_2_19_2","first-page":"9","article-title":"Cordial languages and Cordial numbers","volume":"13","author":"Babujee J.B.","unstructured":"BabujeeJ.B. and ShobanaL., Cordial languages and Cordial numbers, Journal of Applied Computer Science and Mathematics 13(6 (2012)), 9\u201312.","journal-title":"Journal of Applied Computer Science and Mathematics"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.14445\/22315373\/IJMTT-V33P505"},{"issue":"10","key":"e_1_3_2_21_2","first-page":"232","article-title":"Some star and bistar related signed product cordial graphs","volume":"6","author":"Santhi M.","year":"2015","unstructured":"SanthiM., Some star and bistar related signed product cordial graphs, International Journal of Mathematical Archive 6(10) (2015)232\u2013236.","journal-title":"International Journal of Mathematical Archive"},{"key":"e_1_3_2_22_2","first-page":"109","article-title":"Cordial labelings of unicyclic graphs and generalized peterson graphs","volume":"68","author":"Ho Y.S.","year":"1989","unstructured":"HoY.S., LeeS.M. and SheeS.C., Cordial labelings of unicyclic graphs and generalized peterson graphs, Congr Numer 68 (1989)109\u2013122.","journal-title":"Congr Numer"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.14445\/22315373\/IJMTT-V39P507"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.26708\/IJMSC.2014.2.4.04"},{"issue":"3","key":"e_1_3_2_25_2","first-page":"17","article-title":"Cordial labeling of snakes","volume":"2","author":"Vaidya S.K.","year":"2014","unstructured":"VaidyaS.K. and ShahN.H., Cordial labeling of snakes, International Journal of Mathematics And its Applications 2(3) (2014)17\u201327.","journal-title":"International Journal of Mathematics And its Applications"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.3233\/JIFS-171176"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.3233\/JIFS-172195"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-182746","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-182746","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-182746","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:38:58Z","timestamp":1777455538000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-182746"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,2]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,9,9]]}},"alternative-id":["10.3233\/JIFS-182746"],"URL":"https:\/\/doi.org\/10.3233\/jifs-182746","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,2]]}}}