{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:40:56Z","timestamp":1787341256183,"version":"build-2736575974"},"reference-count":27,"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":[{"DOI":"10.13039\/100019904","name":"Vellore Institute of Technology, Chennai","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100019904","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/access.2026.3722560","type":"journal-article","created":{"date-parts":[[2026,8,11]],"date-time":"2026-08-11T19:10:42Z","timestamp":1786475442000},"page":"124103-124122","source":"Crossref","is-referenced-by-count":0,"title":["On the\n                    <i>k<\/i>\n                    -Total Domination Number of Circulant, Shadow, and Strong Product Graphs"],"prefix":"10.1109","volume":"14","author":[{"given":"N.","family":"Eswar","sequence":"first","affiliation":[{"name":"Vellore Institute of Technology","place":["Chennai, India"],"department":["Department of Mathematics"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7878-1578","authenticated-orcid":false,"given":"R.","family":"Jayagopal","sequence":"additional","affiliation":[{"name":"Vellore Institute of Technology","place":["Chennai, India"],"department":["Department of Mathematics"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/2.44900"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/12.21148"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-025-96645-9"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1975.61.225"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(91)90316-T"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2000.876117"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/321958.321964"},{"issue":"1","key":"ref8","first-page":"11","article-title":"Bounds on distance domination parameters","volume":"16","author":"Henning","year":"1991","journal-title":"J. Combin. Inf. Syst. Sci."},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1201\/9781482246582"},{"key":"ref10","volume-title":"Domination in Graphs: Advanced Topics","author":"Haynes","year":"1998"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.12.044"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-6525-6"},{"key":"ref13","first-page":"428","article-title":"NP-completeness of connected and total domination and irredundance for bipartite graphs","author":"Pfaff","year":"1983"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1090\/coll\/038"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230100304"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s42967-026-00580-z"},{"issue":"2","key":"ref17","first-page":"168","article-title":"Total domination in circulant graphs","volume":"4","author":"Chelvam","year":"2011","journal-title":"Int. J. Open Problems Compt. Math"},{"key":"ref18","article-title":"On domination and total domination numbers on strong product of two path graphs","volume-title":"Kalasalingam Acad. Res. Educ.","author":"Thangam","year":"2025"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00341-3"},{"issue":"1","key":"ref20","first-page":"57","article-title":"Total and connected domination numbers for Cayley graphs on $Z_{n}$","volume":"20","author":"Chelvam","year":"2010","journal-title":"Adv. Stud. Contemp. Math."},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.29020\/nybg.ejpam.v18i2.5569"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/BF01162967"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7643-7400-6_24"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.29020\/nybg.ejpam.v18i2.5734"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.61186\/ijmsi.19.1.149"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(01)00244-8"},{"key":"ref27","first-page":"173","article-title":"On the domination number of the circulant graphs $C(n;{1,2})$\n, $C(n;{1,3})$\n and $C(n;{1,4})$","volume":"102","author":"Fu","year":"2011","journal-title":"Ars Combinatoria"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/11323511\/11648159.pdf?arnumber=11648159","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:11:31Z","timestamp":1787339491000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11648159\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/access.2026.3722560","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}