{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T15:02:27Z","timestamp":1746802947307,"version":"3.40.5"},"reference-count":16,"publisher":"Elsevier BV","issue":"21","license":[{"start":{"date-parts":[[2009,11,1]],"date-time":"2009-11-01T00:00:00Z","timestamp":1257033600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,11,6]],"date-time":"2013-11-06T00:00:00Z","timestamp":1383696000000},"content-version":"vor","delay-in-days":1466,"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2009,11]]},"DOI":"10.1016\/j.disc.2009.05.031","type":"journal-article","created":{"date-parts":[[2009,6,27]],"date-time":"2009-06-27T08:27:13Z","timestamp":1246091233000},"page":"6229-6234","update-policy":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"title":["Connected <mml:math xmlns:mml=\"https:\/\/linproxy.fan.workers.dev:443\/http\/www.w3.org\/1998\/Math\/MathML\" altimg=\"si17.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k<\/mml:mi><\/mml:math>-tuple twin domination in de Bruijn and Kautz digraphs"],"prefix":"10.1016","volume":"309","author":[{"given":"Toru","family":"Araki","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2009.05.031_b1","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.ipl.2007.05.010","article-title":"On the k-tuple domination in de Bruijn and Kautz digraphs","volume":"104","author":"Araki","year":"2007","journal-title":"Information Processing Letters"},{"key":"10.1016\/j.disc.2009.05.031_b2","doi-asserted-by":"crossref","first-page":"6406","DOI":"10.1016\/j.disc.2007.12.020","article-title":"The k-tuple twin domination in de Bruijn and Kautz digraphs","volume":"308","author":"Araki","year":"2008","journal-title":"Discrete Mathematics"},{"issue":"16","key":"10.1016\/j.disc.2009.05.031_b3","doi-asserted-by":"crossref","first-page":"1840","DOI":"10.1016\/j.disc.2006.03.061","article-title":"Characterizations of trees with equal paired and double domination numbers","volume":"306","author":"Blidia","year":"2006","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.disc.2009.05.031_b4","first-page":"105","article-title":"Twin domination in digraphs","volume":"67","author":"Chartrand","year":"2003","journal-title":"Ars Combinatoria"},{"key":"10.1016\/j.disc.2009.05.031_b5","first-page":"201","article-title":"Double domination in graphs","volume":"55","author":"Harary","year":"2000","journal-title":"Ars Combinatoria"},{"year":"1998","series-title":"Fundamentals of Domination in Graphs","author":"Haynes","key":"10.1016\/j.disc.2009.05.031_b6"},{"key":"10.1016\/j.disc.2009.05.031_b7","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.ipl.2003.10.004","article-title":"Hardness results and approximation algorithms of k-tuple domination in graphs","volume":"89","author":"Klasing","year":"2004","journal-title":"Information Processing Letters"},{"key":"10.1016\/j.disc.2009.05.031_b8","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1016\/j.tcs.2008.09.058","article-title":"Construction of strongly connected dominating sets in asymmetric multihop wireless networks","volume":"410","author":"Li","year":"2009","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"10.1016\/j.disc.2009.05.031_b9","doi-asserted-by":"crossref","first-page":"415","DOI":"10.11650\/twjm\/1500558307","article-title":"Algorithmic aspect of k-tuple domination in graphs","volume":"6","author":"Liao","year":"2002","journal-title":"Taiwanese Journal of Mathematics"},{"key":"10.1016\/j.disc.2009.05.031_b10","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0020-0190(03)00233-3","article-title":"k-tuple domination in graphs","volume":"87","author":"Liao","year":"2003","journal-title":"Information Processing Letters"},{"key":"10.1016\/j.disc.2009.05.031_b11","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.aml.2006.03.006","article-title":"New bounds on the k-domination number and the k-tuple domination number","volume":"20","author":"Rautenbach","year":"2007","journal-title":"Applied Mathematics Letters"},{"key":"10.1016\/j.disc.2009.05.031_b12","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/j.tcs.2007.04.035","article-title":"Algorithms for minimum m-connected k-tuple dominating set problem","volume":"381","author":"Shang","year":"2007","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.disc.2009.05.031_b13","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.tcs.2007.05.025","article-title":"On approximation algorithms of k-connected m-dominating sets in disk graphs","volume":"385","author":"Thai","year":"2007","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.disc.2009.05.031_b14","doi-asserted-by":"crossref","unstructured":"P. Tvrd\u00edk, Factoring and scaling Kautz digraphs, in: Proceedings of Sixth IEEE Symposium on Parallel and Distributed Processing, 1994, pp. 409\u2013415. https:\/\/linproxy.fan.workers.dev:443\/http\/dx.doi.org\/10.1109\/SPDP.1994.346140","DOI":"10.1109\/SPDP.1994.346140"},{"key":"10.1016\/j.disc.2009.05.031_b15","unstructured":"P. Tvrd\u00eck, Necklace-based factorization of de Bruijn digraphs, in: Proc. Structure, Information and Communication, SIROCCO 96, 1996, pp. 255\u2013268"},{"key":"10.1016\/j.disc.2009.05.031_b16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2005.08.037","article-title":"Minimum connected dominating sets and maximal independent sets in unit disk graphs","volume":"352","author":"Wu","year":"2006","journal-title":"Theoretical Computer Science"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0012365X09003094?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0012365X09003094?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T20:41:02Z","timestamp":1660250462000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X09003094"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11]]},"references-count":16,"journal-issue":{"issue":"21","published-print":{"date-parts":[[2009,11]]}},"alternative-id":["S0012365X09003094"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/j.disc.2009.05.031","relation":{},"ISSN":["0012-365X"],"issn-type":[{"type":"print","value":"0012-365X"}],"subject":[],"published":{"date-parts":[[2009,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Connected -tuple twin domination in de Bruijn and Kautz digraphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/j.disc.2009.05.031","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2009 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}