{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T14:53:15Z","timestamp":1776437595353,"version":"3.51.2"},"reference-count":12,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.dam.2026.03.017","type":"journal-article","created":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T10:53:34Z","timestamp":1773744814000},"page":"251-259","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Dual-server domination in graphs"],"prefix":"10.1016","volume":"387","author":[{"given":"Mustapha","family":"Chellali","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0865-0871","authenticated-orcid":false,"given":"Teresa W.","family":"Haynes","sequence":"additional","affiliation":[]},{"given":"Stephen T.","family":"Hedetniemi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2026.03.017_b1","first-page":"317","article-title":"Independence and 2-domination in trees","volume":"33","author":"Blidia","year":"2005","journal-title":"Australas. J. Comb."},{"key":"10.1016\/j.dam.2026.03.017_b2","first-page":"110","article-title":"Perplexities, with some easy puzzles for beginners","volume":"46","author":"Dudeney","year":"1913","journal-title":"Strand Mag."},{"key":"10.1016\/j.dam.2026.03.017_b3","first-page":"73","article-title":"Problem 251 water, gas, and electricity","volume":"vol. 100","author":"Dudeney","year":"1917"},{"key":"10.1016\/j.dam.2026.03.017_b4","series-title":"Graph Theory with Applications To Algorithms and Computer Science","first-page":"283","article-title":"n-Domination in graphs","author":"Fink","year":"1985"},{"key":"10.1016\/j.dam.2026.03.017_b5","first-page":"201","article-title":"Double domination in graphs","volume":"55","author":"Harary","year":"2000","journal-title":"Ars Combin."},{"key":"10.1016\/j.dam.2026.03.017_b6","article-title":"Topics in domination in graphs","volume":"vol. 64","year":"2020"},{"key":"10.1016\/j.dam.2026.03.017_b7","series-title":"Developments in Mathematics","article-title":"Structures of domination in graphs","volume":"vol. 66","year":"2021"},{"key":"10.1016\/j.dam.2026.03.017_b8","series-title":"Springer Monographs in Mathematics","first-page":"1","article-title":"Domination in graphs: core concepts","author":"Haynes","year":"2023"},{"key":"10.1016\/j.dam.2026.03.017_b9","series-title":"Fundamentals of Domination in Graphs","author":"Haynes","year":"1998"},{"key":"10.1016\/j.dam.2026.03.017_b10","series-title":"Domination in Graphs: Advanced Topics","year":"1998"},{"key":"10.1016\/j.dam.2026.03.017_b11","unstructured":"S.M. Hedetniemi, S.T. Hedetniemi, R.C. Laskar, L. Markus, P.J. Slater, Disjoint dominating sets in graphs, ICDM 2006, in: Proc. of Internat. Conf. Discrete Math., vol. 7, pp. 87\u2013100, Ramanujan Math. Soc., Lect. Notes Ser., 7 in Discrete Mathematics, 2008."},{"key":"10.1016\/j.dam.2026.03.017_b12","first-page":"7","article-title":"Complexity questions for n-domination and related parameters","volume":"68","author":"Jacobson","year":"1989","journal-title":"Congr. Numer."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26001617?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26001617?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T14:06:40Z","timestamp":1776434800000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26001617"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":12,"alternative-id":["S0166218X26001617"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.03.017","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Dual-server domination in graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.03.017","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}