{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T05:21:52Z","timestamp":1768281712578,"version":"3.49.0"},"reference-count":25,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Vellore Institute of Technology, Chennai, India"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/access.2025.3647283","type":"journal-article","created":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T18:42:48Z","timestamp":1766428968000},"page":"4162-4179","source":"Crossref","is-referenced-by-count":0,"title":["Optimization of Sigma Coloring in Cartesian Products of Graphs and Lower Bounds for Sigma Chromatic Numbers of Graphs Containing Complete Subgraphs"],"prefix":"10.1109","volume":"14","author":[{"given":"C.","family":"Yogalakshmi","sequence":"first","affiliation":[{"name":"Department of Mathematics, School of Advanced Sciences, Vellore Institute of Technology, Chennai, Tamil Nadu, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9652-4321","authenticated-orcid":false,"given":"B. J.","family":"Balamurugan","sequence":"additional","affiliation":[{"name":"Department of Mathematics, School of Advanced Sciences, Vellore Institute of Technology, Chennai, Tamil Nadu, India"}]}],"member":"263","reference":[{"key":"ref1","first-page":"216","article-title":"The sigma chromatic number of the circulant graphs Cn(1, 2), Cn(1, 3), and C2n(1, n)","volume-title":"Proc. Jpn. Conf. Discrete Comput. Geometry Graphs","author":"Luzon"},{"key":"ref2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"Bondy","year":"2008"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.gltp.2022.03.005"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JSYST.2020.2978105"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/LLVMHPCHiPar51896.2020.00008"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/Confluence51648.2021.9377151"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-010-0952-7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.23638\/dmtcs-20-2-19"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2019.08.043"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1538\/1\/012002"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1142\/S1793557121500194"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1142\/S1793557122500061"},{"key":"ref13","article-title":"On the sigma chromatic number of the join of paths, cycles and complete multipartite graphs","author":"Lagura","year":"2016"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1538\/1\/012003"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-41420-6_63"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/2157\/1\/012001"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1142\/S1793557123501437"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/BF01162967"},{"key":"ref19","article-title":"Asynchronous fault-tolerant distributed proper coloring of graphs","author":"Balliu","year":"2024","journal-title":"arXiv:2408.10971"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2018.2889688"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.3390\/s20123509"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2020.09.035"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2014.07.012"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1155\/2020\/1436872"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s12083-023-01462-4"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/11323511\/11311455.pdf?arnumber=11311455","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T22:03:06Z","timestamp":1768255386000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11311455\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/access.2025.3647283","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}