{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T06:04:12Z","timestamp":1750831452946,"version":"3.37.3"},"reference-count":10,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["MOST 107-2811-M-003-516"],"award-info":[{"award-number":["MOST 107-2811-M-003-516"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["MOST 107-2115-M-003-009-MY3"],"award-info":[{"award-number":["MOST 107-2115-M-003-009-MY3"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["MOST 107-2811-M-009-026"],"award-info":[{"award-number":["MOST 107-2811-M-009-026"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["MOST 107-2917-I-564-004"],"award-info":[{"award-number":["MOST 107-2917-I-564-004"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2020,8]]},"abstract":"<jats:p> Let [Formula: see text] be a simple undirected graph. [Formula: see text] is a circulant graph defined on [Formula: see text] with difference set [Formula: see text] provided two vertices [Formula: see text] and [Formula: see text] in [Formula: see text] are adjacent if and only if [Formula: see text]. For convenience, we use [Formula: see text] to denote such a circulant graph. <\/jats:p><jats:p> A function [Formula: see text] is an integer [Formula: see text]-domination function if for each [Formula: see text], [Formula: see text] By considering all [Formula: see text]-domination functions [Formula: see text], the minimum value of [Formula: see text] is the [Formula: see text]-domination number of [Formula: see text], denoted by [Formula: see text]. In this paper, we prove that if [Formula: see text], [Formula: see text], then the integer [Formula: see text]-domination number of [Formula: see text] is [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s179383092050055x","type":"journal-article","created":{"date-parts":[[2020,5,29]],"date-time":"2020-05-29T16:56:17Z","timestamp":1590771377000},"page":"2050055","source":"Crossref","is-referenced-by-count":3,"title":["The integer {k}-domination number of circulant graphs"],"prefix":"10.1142","volume":"12","author":[{"given":"Yen-Jen","family":"Cheng","sequence":"first","affiliation":[{"name":"Department of Mathematics, National Taiwan Normal University, Taipei 11677, Taiwan"}]},{"given":"Hung-Lin","family":"Fu","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics, National Chiao Tung University, Hsinchu 30010, Taiwan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0905-5505","authenticated-orcid":false,"given":"Chia-An","family":"Liu","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Xiamen University, Malaysia, Selangor 43900, Malaysia"}]}],"member":"219","published-online":{"date-parts":[[2020,5,28]]},"reference":[{"key":"S179383092050055XBIB001","doi-asserted-by":"publisher","DOI":"10.1287\/opre.28.5.1074"},{"key":"S179383092050055XBIB002","doi-asserted-by":"publisher","DOI":"10.11650\/twjm\/1500557305"},{"issue":"4","key":"S179383092050055XBIB003","first-page":"525","volume":"22","author":"Chelvam T. T.","year":"2012","journal-title":"Adv. Stud. Contemp. Math. (Kyungshang)"},{"key":"S179383092050055XBIB004","first-page":"371","volume":"1","author":"Domke G.","year":"1991","journal-title":"Graph Theory, Combinatorics, and applications"},{"key":"S179383092050055XBIB005","doi-asserted-by":"publisher","DOI":"10.1145\/321694.321699"},{"key":"S179383092050055XBIB006","doi-asserted-by":"publisher","DOI":"10.1137\/11082574"},{"key":"S179383092050055XBIB007","doi-asserted-by":"publisher","DOI":"10.1561\/0100000006"},{"volume-title":"Domination in Graphs: Advanced Topics","year":"1998","author":"Haynes T. W.","key":"S179383092050055XBIB008"},{"key":"S179383092050055XBIB009","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2008.07.030"},{"key":"S179383092050055XBIB010","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2012.10.008"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S179383092050055X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,13]],"date-time":"2020-08-13T09:53:39Z","timestamp":1597312419000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S179383092050055X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,28]]},"references-count":10,"journal-issue":{"issue":"04","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["10.1142\/S179383092050055X"],"URL":"https:\/\/doi.org\/10.1142\/s179383092050055x","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2020,5,28]]}}}