{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:47:52Z","timestamp":1759063672514,"version":"3.37.3"},"reference-count":22,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T00:00:00Z","timestamp":1728950400000},"content-version":"vor","delay-in-days":1475,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006565","name":"University of Johannesburg","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006565","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1016\/j.dam.2020.07.010","type":"journal-article","created":{"date-parts":[[2020,7,25]],"date-time":"2020-07-25T09:10:13Z","timestamp":1595668213000},"page":"691-706","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["2-limited broadcast domination in subcubic graphs"],"prefix":"10.1016","volume":"285","author":[{"given":"Michael A.","family":"Henning","sequence":"first","affiliation":[]},{"given":"Gary","family":"MacGillivray","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Yang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2020.07.010_b1","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.disc.2017.08.025","article-title":"Independent domination in subcubic graphs of girth at least six","volume":"341","author":"Abrishami","year":"2018","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2020.07.010_b2","first-page":"55","article-title":"Broadcast domination algorithms for interval graphs, series-parallel graphs, and trees","volume":"169","author":"Blair","year":"2004","journal-title":"Congr. Numer."},{"key":"10.1016\/j.dam.2020.07.010_b3","first-page":"303","article-title":"Broadcast domination of products of graphs","volume":"92","author":"Bre\u0161ar","year":"2009","journal-title":"Ars Combin."},{"key":"10.1016\/j.dam.2020.07.010_b4","first-page":"1334","article-title":"New bounds for the broadcast domination number of a graph","volume":"11","author":"Brewster","year":"2013","journal-title":"Cent. Eur. J. Math."},{"issue":"1","key":"10.1016\/j.dam.2020.07.010_b5","doi-asserted-by":"crossref","first-page":"205","DOI":"10.2298\/AADM1801205C","article-title":"Dominating 2-broadcast in graphs: complexity, bounds and extremal graphs","volume":"12","author":"C\u00e1ceres","year":"2018","journal-title":"Appl. Anal. Discrete Math."},{"key":"10.1016\/j.dam.2020.07.010_b6","article-title":"General bounds on limited broadcast domination","volume":"20","author":"C\u00e1ceres","year":"2018","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"10.1016\/j.dam.2020.07.010_b7","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1002\/net.20275","article-title":"A linear-time algorithm for broadcast domination in a tree","volume":"53","author":"Dabney","year":"2009","journal-title":"Networks"},{"issue":"4","key":"10.1016\/j.dam.2020.07.010_b8","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1002\/jgt.21855","article-title":"Independent domination in cubic graphs","volume":"80","author":"Dorbec","year":"2015","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2020.07.010_b9","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.dam.2005.07.009","article-title":"Broadcasts in graphs","volume":"154","author":"Dunbar","year":"2006","journal-title":"Discrete Appl. Math."},{"year":"2001","series-title":"Cost Domination in Graphs","author":"Erwin","key":"10.1016\/j.dam.2020.07.010_b10"},{"key":"10.1016\/j.dam.2020.07.010_b11","first-page":"89","article-title":"Dominating broadcasts in graphs","volume":"42","author":"Erwin","year":"2004","journal-title":"Bull. ICA"},{"key":"10.1016\/j.dam.2020.07.010_b12","first-page":"19","article-title":"On the difference between broadcast and multipacking number of graphs","volume":"94","author":"Hartnell","year":"2014","journal-title":"Util. Math."},{"key":"10.1016\/j.dam.2020.07.010_b13","doi-asserted-by":"crossref","first-page":"3267","DOI":"10.1016\/j.disc.2006.06.013","article-title":"Optimal broadcast domination in polynomial time","volume":"306","author":"Heggernes","year":"2006","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2020.07.010_b14","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/j.dam.2018.04.022","article-title":"k-Broadcast domination and k-multipacking","volume":"250","author":"Henning","year":"2018","journal-title":"Discrete Appl. Math."},{"year":"2013","series-title":"Total Domination in Graphs","author":"Henning","key":"10.1016\/j.dam.2020.07.010_b15"},{"key":"10.1016\/j.dam.2020.07.010_b16","doi-asserted-by":"crossref","first-page":"5950","DOI":"10.1016\/j.disc.2009.04.024","article-title":"Radial trees","volume":"309","author":"Herke","year":"2009","journal-title":"Discrete Math."},{"year":"2006","series-title":"Counterexamples to the cubic graph domination conjecture","author":"Kelmans","key":"10.1016\/j.dam.2020.07.010_b17"},{"key":"10.1016\/j.dam.2020.07.010_b18","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.disc.2005.07.005","article-title":"On domination in connected cubic graphs","volume":"304","author":"Kostochka","year":"2005","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2020.07.010_b19","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1017\/S0963548300002042","article-title":"Paths, stars, and the number three","volume":"5","author":"Reed","year":"1996","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/j.dam.2020.07.010_b20","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1002\/jgt.21649","article-title":"Edge weighting functions on dominating sets","volume":"72","author":"Southey","year":"2013","journal-title":"J. Graph Theory"},{"year":"2012","series-title":"Broadcasts and Multipackings in Graphs","author":"Teshima","key":"10.1016\/j.dam.2020.07.010_b21"},{"year":"2015","series-title":"New Results on Broadcast Domination and Multipacking","author":"Yang","key":"10.1016\/j.dam.2020.07.010_b22"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X20303565?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X20303565?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T03:30:04Z","timestamp":1728963004000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X20303565"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10]]},"references-count":22,"alternative-id":["S0166218X20303565"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2020.07.010","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2020,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"2-limited broadcast domination in subcubic graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2020.07.010","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2020 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}